 | 2009 |
|---|
| 108 |       | Joost Vennekens,
Marc Denecker:
FO(ID) as an Extension of DL with Rules.
ESWC 2009: 384-398 |
| 107 | | Marc Denecker:
A Knowledge Base System Project for FO(.).
ICLP 2009: 22 |
| 106 | | Johan Wittocx,
Hanne Vlaeminck,
Marc Denecker:
Debugging for Model Expansion.
ICLP 2009: 296-311 |
| 105 | | Ping Hou,
Marc Denecker:
A Deductive System for FO(ID) Based on Least Fixpoint Logic.
LPNMR 2009: 129-141 |
| 104 | | Marc Denecker,
Joost Vennekens:
Using Lightweight Inference to Solve Lightweight Problems.
LPNMR 2009: 619-621 |
| 103 | | Marc Denecker,
Joost Vennekens,
Stephen Bond,
Martin Gebser,
Miroslaw Truszczynski:
The Second Answer Set Programming Competition.
LPNMR 2009: 637-654 |
| 102 | | Hanne Vlaeminck,
Joost Vennekens,
Marc Denecker:
A logical framework for configuration software.
PPDP 2009: 141-148 |
| 101 | | Joost Vennekens,
Marc Denecker,
Maurice Bruynooghe:
CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming
CoRR abs/0904.1672: (2009) |
| 2008 |
|---|
| 100 |  | Johan Wittocx,
Maarten Mariën,
Marc Denecker:
Grounding with Bounds.
AAAI 2008: 572-577 |
| 99 | | Marc Denecker,
Joost Vennekens:
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic.
ICLP 2008: 71-76 |
| 98 | | Johan Wittocx,
Maarten Mariën,
Marc Denecker:
Approximate Reasoning in First-Order Logic Theories.
KR 2008: 103-112 |
| 97 | | Alvaro Cortés-Calabuig,
Marc Denecker,
Ofer Arieli,
Maurice Bruynooghe:
Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases.
KR 2008: 81-91 |
| 96 | | Maarten Mariën,
Johan Wittocx,
Marc Denecker,
Maurice Bruynooghe:
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions.
SAT 2008: 211-224 |
| 95 | | Marc Denecker,
Eugenia Ternovska:
A logic of nonmonotone inductive definitions.
ACM Trans. Comput. Log. 9(2): (2008) |
| 2007 |
|---|
| 94 | | Alvaro Cortés-Calabuig,
Marc Denecker,
Ofer Arieli,
Maurice Bruynooghe:
Approximate Query Answering in Locally Closed Databases.
AAAI 2007: 397-402 |
| 93 | | Maarten Mariën,
Johan Wittocx,
Marc Denecker:
Integrating Inductive Definitions in SAT.
LPAR 2007: 378-392 |
| 92 | | Ping Hou,
Johan Wittocx,
Marc Denecker:
A Deductive System for PC(ID).
LPNMR 2007: 162-174 |
| 91 | | Marc Denecker,
Joost Vennekens:
Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions.
LPNMR 2007: 84-96 |
| 90 | | Joost Vennekens,
David Gilis,
Marc Denecker:
Erratum to splitting an operator: Algebraic modularity results for logics with fixpoint semantics.
ACM Trans. Comput. Log. 8(1): (2007) |
| 89 | | Ofer Arieli,
Marc Denecker,
Maurice Bruynooghe:
Distance semantics for database repair.
Ann. Math. Artif. Intell. 50(3-4): 389-415 (2007) |
| 88 | | Marc Denecker,
Eugenia Ternovska:
Inductive situation calculus.
Artif. Intell. 171(5-6): 332-360 (2007) |
| 87 | | Joost Vennekens,
Johan Wittocx,
Maarten Mariën,
Marc Denecker:
Predicate Introduction for Logics with a Fixpoint Semantics. Part I: Logic Programming.
Fundam. Inform. 79(1-2): 187-208 (2007) |
| 86 | | Joost Vennekens,
Johan Wittocx,
Maarten Mariën,
Marc Denecker:
Predicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic.
Fundam. Inform. 79(1-2): 209-227 (2007) |
| 85 | | Nikolay Pelov,
Marc Denecker,
Maurice Bruynooghe:
Well-founded and stable semantics of logic programs with aggregates.
TPLP 7(3): 301-353 (2007) |
| 2006 |
|---|
| 84 | | Johan Wittocx,
Joost Vennekens,
Maarten Mariën,
Marc Denecker,
Maurice Bruynooghe:
Predicate Introduction Under Stable and Well-Founded Semantics.
ICLP 2006: 242-256 |
| 83 | | Ofer Arieli,
Marc Denecker,
Maurice Bruynooghe:
Distance-Based Repairs of Databases.
JELIA 2006: 43-55 |
| 82 | | Joost Vennekens,
Marc Denecker,
Maurice Bruynooghe:
Representing Causal Information About a Probabilistic Process.
JELIA 2006: 452-464 |
| 81 | | Alvaro Cortés-Calabuig,
Marc Denecker,
Ofer Arieli,
Maurice Bruynooghe:
Representation of Partial Knowledge and Query Answering in Locally Complete Databases.
LPAR 2006: 407-421 |
| 80 | | Joost Vennekens,
David Gilis,
Marc Denecker:
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics.
ACM Trans. Comput. Log. 7(4): 765-797 (2006) |
| 79 | | Ofer Arieli,
Marc Denecker,
Bert Van Nuffelen,
Maurice Bruynooghe:
Computational methods for database repair by signed formulae.
Ann. Math. Artif. Intell. 46(1-2): 4-37 (2006) |
| 2005 |
|---|
| 78 | | Joost Vennekens,
Marc Denecker:
An Algebraic Account of Modularity in ID-logic.
Answer Set Programming 2005 |
| 77 | | Alvaro Cortés-Calabuig,
Marc Denecker,
Ofer Arieli,
Bert Van Nuffelen,
Maurice Bruynooghe:
On the Local Closed-World Assumption of Data-Sources.
BNAIC 2005: 333-334 |
| 76 | | Maarten Mariën,
Rudradeb Mitra,
Marc Denecker,
Maurice Bruynooghe:
Satisfiability Checking for PC(ID).
LPAR 2005: 565-579 |
| 75 | | Alvaro Cortés-Calabuig,
Marc Denecker,
Ofer Arieli,
Bert Van Nuffelen,
Maurice Bruynooghe:
On the Local Closed-World Assumption of Data-Sources.
LPNMR 2005: 145-157 |
| 74 | | Joost Vennekens,
Marc Denecker:
An Algebraic Account of Modularity in ID-Logic.
LPNMR 2005: 291-303 |
| 73 | | Marc Denecker,
Eugenia Ternovska:
A Logic for Non-Monotone Inductive Definitions
CoRR abs/cs/0501025: (2005) |
| 72 | | Nikolay Pelov,
Marc Denecker,
Maurice Bruynooghe:
Well-founded and Stable Semantics of Logic Programs with Aggregates
CoRR abs/cs/0509024: (2005) |
| 2004 |
|---|
| 71 | | Bert Van Nuffelen,
Alvaro Cortés-Calabuig,
Marc Denecker,
Ofer Arieli,
Maurice Bruynooghe:
Data Integration Using ID-Logic.
CAiSE 2004: 67-81 |
| 70 | | Ofer Arieli,
Marc Denecker,
Bert Van Nuffelen,
Maurice Bruynooghe:
Database Repair by Signed Formulae.
FoIKS 2004: 14-30 |
| 69 | | Joost Vennekens,
David Gilis,
Marc Denecker:
Splitting an Operator.
ICLP 2004: 195-209 |
| 68 | | Maarten Mariën,
David Gilis,
Marc Denecker:
On the Relation Between ID-Logic and Answer Set Programming.
JELIA 2004: 108-120 |
| 67 | | Marc Denecker:
What's in a Model? Epistemological Analysis of Logic Programming.
KR 2004: 106-113 |
| 66 | | Marc Denecker,
Eugenia Ternovska:
Inductive Situation Calculus.
KR 2004: 545-553 |
| 65 | | Nikolay Pelov,
Marc Denecker,
Maurice Bruynooghe:
Partial Stable Models for Logic Programs with Aggregates.
LPNMR 2004: 207-219 |
| 64 | | Marc Denecker,
Eugenia Ternovska:
A Logic of Non-monotone Inductive Definitions and Its Modularity Properties.
LPNMR 2004: 47-60 |
| 63 | | Joost Vennekens,
David Gilis,
Marc Denecker:
Splitting an operator: an algebraic modularity result and its application to auto-epistemic logic.
NMR 2004: 400-408 |
| 62 | | Joost Vennekens,
David Gilis,
Marc Denecker:
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
CoRR cs.AI/0405002: (2004) |
| 61 | | Marc Denecker,
Victor W. Marek,
Miroslaw Truszczynski:
Ultimate approximation and its application in nonmonotonic knowledge representation systems.
Inf. Comput. 192(1): 84-121 (2004) |
| 60 | | Ofer Arieli,
Marc Denecker,
Bert Van Nuffelen,
Maurice Bruynooghe:
Coherent Integration of Databases by Abductive Logic Programming.
J. Artif. Intell. Res. (JAIR) 21: 245-286 (2004) |
| 2003 |
|---|
| 59 | | Nikolay Pelov,
Marc Denecker,
Maurice Bruynooghe:
Translation of Aggregate Programs to Normal Logic Programs.
Answer Set Programming 2003 |
| 58 | | Marc Denecker:
What's in a model? Epistemological analysis of Logic Programming.
Answer Set Programming 2003 |
| 57 | | Marc Denecker,
V. Wiktor Marek,
Miroslaw Truszczynski:
Uniform semantic treatment of default and autoepistemic logics.
Artif. Intell. 143(1): 79-122 (2003) |
| 56 | | Ofer Arieli,
Marc Denecker:
Reducing Preferential Paraconsistent Reasoning to Classical Entailment.
J. Log. Comput. 13(4): 557-580 (2003) |
| 2002 |
|---|
| 55 | | Marc Denecker,
Antonis C. Kakas:
Abduction in Logic Programming.
Computational Logic: Logic Programming and Beyond 2002: 402-436 |
| 54 | | Pieter Bekaert,
Bert Van Nuffelen,
Maurice Bruynooghe,
David Gilis,
Marc Denecker:
On the Transformation of Object-Oriented Conceptual Models to Logical Theories.
ER 2002: 152-166 |
| 53 | | Ofer Arieli,
Marc Denecker:
Modeling Paraconsistent Reasoning by Classical Logic.
FoIKS 2002: 1-14 |
| 52 | | Marc Denecker,
V. Wiktor Marek,
Miroslaw Truszczynski:
Ultimate Approximations in Nonmonotonic Knowledge Representation Systems.
KR 2002: 177-190 |
| 51 | | Marc Denecker:
Unifying abductive logic programming and stable logic programming.
NMR 2002: 183 |
| 50 | | David Gilis,
Marc Denecker:
Compositionally results for stratified nonmonotone operators.
NMR 2002: 51-56 |
| 49 | | Ofer Arieli,
Marc Denecker,
Bert Van Nuffelen,
Maurice Bruynooghe:
Repairing Inconsistent Databases: A Model-Theoretic Approach and Abductive Reasoning.
Paraconsistent Computational Logic 2002: 51-65 |
| 48 | | Marc Denecker,
V. Wiktor Marek,
Miroslaw Truszczynski:
Ultimate approximations in nonmonotonic knowledge representation systems
CoRR cs.AI/0205014: (2002) |
| 2001 |
|---|
| 47 | | Marc Denecker:
On the Epistemological foundations of Logic Programming and its Extensions.
Answer Set Programming 2001 |
| 46 | | Marc Denecker,
Nikolay Pelov,
Maurice Bruynooghe:
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates.
ICLP 2001: 212-226 |
| 45 | | Antonis C. Kakas,
Bert Van Nuffelen,
Marc Denecker:
A-System: Problem Solving through Abduction.
IJCAI 2001: 591-596 |
| 44 | | Ofer Arieli,
Bert Van Nuffelen,
Marc Denecker,
Maurice Bruynooghe:
Coherent Composition of Distributed Knowledge-Bases Through Abduction.
LPAR 2001: 624-638 |
| 43 | | Marc Denecker,
Maurice Bruynooghe,
V. Wiktor Marek:
Logic programming revisited: Logic programs as inductive definitions.
ACM Trans. Comput. Log. 2(4): 623-654 (2001) |
| 2000 |
|---|
| 42 | | Marc Denecker:
Extending Classical Logic with Inductive Definitions.
Computational Logic 2000: 703-717 |
| 41 | | Marc Denecker,
V. Wiktor Marek,
Miroslaw Truszczynski:
Uniform semantic treatment of default and autoepistemic logic.
KR 2000: 74-84 |
| 40 | | Nikolay Pelov,
Emmanuel De Mot,
Marc Denecker:
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison.
LPAR 2000: 225-239 |
| 39 | | Danny De Schreye,
Maurice Bruynooghe,
Bart Demoen,
Marc Denecker,
Gerda Janssens,
Bern Martens:
Project Report on LP+: A Second Generation Logic Programming Language.
AI Commun. 13(1): 13-18 (2000) |
| 38 | | Marc Denecker,
Victor W. Marek,
Miroslaw Truszczynski:
Uniform semantic treatment of default and autoepistemic logics
CoRR cs.AI/0002002: (2000) |
| 37 | | Bert Van Nuffelen,
Marc Denecker:
Problem solving in ID-logic with aggregates: some experiments
CoRR cs.AI/0003030: (2000) |
| 36 | | Nikolay Pelov,
Emmanuel De Mot,
Marc Denecker:
Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison
CoRR cs.AI/0011030: (2000) |
| 35 | | Sven Verdoolaege,
Marc Denecker,
Ness Schelkens,
Danny De Schreye,
Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference
CoRR cs.CL/0011034: (2000) |
| 34 | | Sven Verdoolaege,
Marc Denecker,
Frank Van Eynde:
Abductive reasoning with temporal information
CoRR cs.CL/0011035: (2000) |
| 33 | | Marc Denecker:
Extending Classical Logic with Inductive Definitions
CoRR cs.LO/0003019: (2000) |
| 32 | | Marc Denecker:
A note on the Declarative reading(s) of Logic Programming
CoRR cs.LO/0003056: (2000) |
| 31 | | Maurice Bruynooghe,
Henk Vandecasteele,
D. Andre de Waal,
Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs
CoRR cs.LO/0003067: (2000) |
| 30 | | Sofie Verbaeten,
Marc Denecker,
Danny De Schreye:
Compositionality of Normal Open Logic Programs.
J. Log. Program. 42(3): 151-183 (2000) |
| 29 | | Marc Denecker,
Antonis C. Kakas:
Special issue: abductive logic programming.
J. Log. Program. 44(1-3): 1-4 (2000) |
| 1999 |
|---|
| 28 | | Sven Verdoolaege,
Marc Denecker,
Ness Schelkens,
Danny De Schreye,
Frank Van Eynde:
Semantic interpretation of temporal information by abductive inference.
CLIN 1999 |
| 27 | | Marc Denecker,
V. Wiktor Marek,
Miroslaw Truszczynski:
Fixpoint 3-valued semantics for autoepistemic logic
CoRR cs.LO/9901003: (1999) |
| 26 | | Maurice Bruynooghe,
Henk Vandecasteele,
D. Andre de Waal,
Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs
Journal of Functional and Logic Programming 1999(Special Issue 2): (1999) |
| 1998 |
|---|
| 25 | | Marc Denecker,
V. Wiktor Marek,
Miroslaw Truszczynski:
Fixpoint 3-Valued Semantics for Autoepistemic Logic.
AAAI/IAAI 1998: 840-845 |
| 24 | | Marc Denecker:
The Well-Founded Semantics Is the Principle of Inductive Definition.
JELIA 1998: 1-16 |
| 23 | | Maurice Bruynooghe,
Henk Vandecasteele,
D. Andre de Waal,
Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs.
PLILP/ALP 1998: 118-133 |
| 22 | | Marc Denecker,
Daniele Theseider Dupré,
Kristof Van Belleghem:
An Inductive Definition Approach to Ramifications.
Electron. Trans. Artif. Intell. 2: 25-67 (1998) |
| 21 | | Marc Denecker,
Danny De Schreye:
SLDNFA: An Abductive Procedure for Abductive Logic Programs.
J. Log. Program. 34(2): 111-167 (1998) |
| 1997 |
|---|
| 20 | | Kristof Van Belleghem,
Marc Denecker,
Danny De Schreye:
A Strong Correspondence between Description Logics and Open Logic Programming.
ICLP 1997: 346-360 |
| 19 | | Sofie Verbaeten,
Marc Denecker,
Danny De Schreye:
Compositionality of Normal Open Logic Programs.
ILPS 1997: 371-385 |
| 18 | | Kristof Van Belleghem,
Marc Denecker,
Danny De Schreye:
On the Relation Between Situation Calculus and Event Calculus.
J. Log. Program. 31(1-3): 3-37 (1997) |
| 1996 |
|---|
| 17 | | Marc Denecker,
Kristof Van Belleghem,
Guy Duchatelet,
Frank Piessens,
Danny De Schreye:
A Realistic Experiment in Knowledge Representation in Open Event Calculus: Protocol Specification.
JICSLP 1996: 170-184 |
| 16 | | Maurice Bruynooghe,
Bart Demoen,
Dmitri Boulanger,
Marc Denecker,
Anne Mulkers:
A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation.
SAS 1996: 128-142 |
| 1995 |
|---|
| 15 | | Marc Denecker,
Guy Duchatelet,
Frank Piessens,
Kristof Van Belleghem,
Danny De Schreye:
Using Event Calculus for Protocol Specification: An Experiment.
Deductive Databases / Abduction in Deductive Databases 1995: 187-201 |
| 14 | | Kristof Van Belleghem,
Marc Denecker,
Danny De Schreye:
Combining Situation Calculus and Event Calculus.
ICLP 1995: 83-97 |
| 13 | | Hilde Adé,
Marc Denecker:
AILP: Abductive Inductive Logic Programming.
IJCAI 1995: 1201-1209 |
| 12 | | Marc Denecker:
A Terminological Interpretation of (Abductive) Logic Programming.
LPNMR 1995: 15-28 |
| 11 | | Marc Denecker,
Danny De Schreye:
Representing Incomplete Knowledge in Abductive Logic Programming.
J. Log. Comput. 5(5): 553-577 (1995) |
| 10 | | Lode Missiaen,
Maurice Bruynooghe,
Marc Denecker:
CHICA, an Abductive Planning System Based on Event Calculus.
J. Log. Comput. 5(5): 579-602 (1995) |
| 1994 |
|---|
| 9 | | Kristof Van Belleghem,
Marc Denecker,
Danny De Schreye:
Representing Continuous Change in the Abductive Event Calculus.
ICLP 1994: 225-239 |
| 8 | | Kristof Van Belleghem,
Marc Denecker,
Danny De Schreye:
The Abductive Event Calculus as a General Framework for Temporal Databases.
ICTL 1994: 301-316 |
| 7 | | Dmitri Boulanger,
Maurice Bruynooghe,
Marc Denecker:
Abstracting s-semantincs Using A Model-Theoretic Approach.
PLILP 1994: 432-446 |
| 6 | | Marc Denecker,
Danny De Schreye:
On the Duality of Abduction and Model Generation in a Framework for Model Generation with Equality.
Theor. Comput. Sci. 122(1&2): 225-262 (1994) |
| 1993 |
|---|
| 5 | | Marc Denecker,
Danny De Schreye:
Representing Incomplete Knowledge in Abductive Logic Programming.
ILPS 1993: 147-163 |
| 4 | | Marc Denecker,
Danny De Schreye:
Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs.
LPNMR 1993: 365-379 |
| 1992 |
|---|
| 3 | | Marc Denecker,
Lode Missiaen,
Maurice Bruynooghe:
Temporal Reasoning with Abductive Event Calculus.
ECAI 1992: 384-388 |
| 2 | | Marc Denecker,
Danny De Schreye:
On the Duality of Abduction and Model Generation.
FGCS 1992: 650-657 |
| 1 | | Marc Denecker,
Danny De Schreye:
SLDNFA: An Abductive Procedure for Normal Abductive Programs.
JICSLP 1992: 686-700 |
