Marc Denecker | DeepAI

AI Chat

Featured Co-authors

Miroslaw Truszczynski
26 publications
Jan Van den Bussche
25 publications
Bart Bogaerts
25 publications
Joost Vennekens
23 publications
Yuliya Lierler
22 publications
Maurice Bruynooghe
8 publications
Jesse Heyninck
7 publications
Marcos Cramer
7 publications
Simon Vandevelde
5 publications
David S. Warren
5 publications
Victor W. Marek
5 publications

∙ 06/05/2023

Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access Control

In this paper we define and study a multi-agent extension of autoepistem...

0 Marcos Cramer, et al. ∙

∙ 05/20/2023

Interactive Model Expansion in an Observable Environment

Many practical problems can be understood as the search for a state of a...

0 Pierre Carbonnelle, et al. ∙

∙ 04/26/2023

The Logic of Logic Programming

Our position is that logic programming is not programming in the Horn cl...

0 Marc Denecker, et al. ∙

∙ 05/09/2022

On Nested Justification Systems (full version)

Justification theory is a general framework for the definition of semant...

0 Simon Marynissen, et al. ∙

∙ 02/02/2022

Quantification and aggregation over concepts of the ontology

The first phase of developing an intelligent system is the selection of ...

0 Pierre Carbonnelle, et al. ∙

∙ 02/01/2022

IDP-Z3: a reasoning engine for FO(.)

An important sign of intelligence is the capacity to apply a body of kno...

0 Pierre Carbonnelle, et al. ∙

∙ 04/30/2021

Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory

Aggregates provide a concise way to express complex knowledge. While the...

0 Linde Vanbesien, et al. ∙

∙ 02/02/2021

Justifications and a Reconstruction of Parity Game Solving Algorithms

Parity games are infinite two-player games played on directed graphs. Pa...

0 Ruben Lapauw, et al. ∙

∙ 08/04/2020

Exploiting Game Theory for Analysing Justifications

Justification theory is a unifying semantic framework. While it has its ...

0 Simon Marynissen, et al. ∙

∙ 01/26/2019

The informal semantics of Answer Set Programming: A Tarskian perspective

In Knowledge Representation, it is crucial that knowledge engineers have...

0 Marc Denecker, et al. ∙

∙ 08/23/2018

Transpiling Programmable Computable Functions to Answer Set Programs

Programming Computable Functions (PCF) is a simplified programming langu...

0 Ingmar Dasseville, et al. ∙

∙ 11/03/2015

Visualising interactive inferences with IDPD3

A large part of the use of knowledge base systems is the interpretation ...

0 Ruben Lapauw, et al. ∙

∙ 05/08/2014

FO(C): A Knowledge Representation Language of Causality

Cause-effect relations are an important part of human knowledge. In real...

0 Bart Bogaerts, et al. ∙

∙ 01/16/2014

Grounding FO and FO(ID) with Bounds

Grounding is the task of reducing a first-order theory and finite domain...

0 Johan Wittocx, et al. ∙

∙ 01/08/2013

Extending FO(ID) with Knowledge Producing Definitions: Preliminary Results

Previous research into the relation between ASP and classical logic has ...

0 Joost Vennekens, et al. ∙

∙ 07/11/2012

LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions

The logic FO(ID) uses ideas from the field of logic programming to exten...

0 Ping Hou, et al. ∙

∙ 08/29/2011

A prototype of a knowledge-based programming environment

In this paper we present a proposal for a knowledge-based programming en...

0 Stef De Pooter, et al. ∙

∙ 08/16/2011

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too

A fact apparently not observed earlier in the literature of nonmonotonic...

0 Marc Denecker, et al. ∙

∙ 04/10/2009

CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming

This papers develops a logical language for representing probabilistic c...

0 Joost Vennekens, et al. ∙

∙ 05/11/2002

Ultimate approximations in nonmonotonic knowledge representation systems

We study fixpoints of operators on lattices. To this end we introduce th...

0 Marc Denecker, et al. ∙

∙ 03/17/2000

Detecting Unsolvable Queries for Definite Logic Programs

In solving a query, the SLD proof procedure for definite programs someti...

0 Maurice Bruynooghe, et al. ∙

∙ 03/13/2000

A note on the Declarative reading(s) of Logic Programming

This paper analyses the declarative readings of logic programming. Logic...

0 Marc Denecker, et al. ∙

∙ 03/08/2000

Problem solving in ID-logic with aggregates: some experiments

The goal of the LP+ project at the K.U.Leuven is to design an expressive...

0 Bert Van Nuffelen, et al. ∙

∙ 03/07/2000

Extending Classical Logic with Inductive Definitions

The goal of this paper is to extend classical logic with a generalized n...

0 Marc Denecker, et al. ∙

∙ 02/03/2000

Uniform semantic treatment of default and autoepistemic logics

We revisit the issue of connections between two leading formalisms in no...

0 Marc Denecker, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world