Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Marc Denecker
2010 – today
- 2013
[i21]Joost Vennekens, Marc Denecker: Extending FO(ID) with Knowledge Producing Definitions: Preliminary Results. CoRR abs/1301.1395 (2013)- 2012
- [j30]Hanne Vlaeminck, Joost Vennekens, Marc Denecker, Maurice Bruynooghe: An approximative inference method for solving ∃∀SO satisfiability problems. J. Artif. Intell. Res. (JAIR) 45: 79-124 (2012)
- [c81]Hanne Vlaeminck, Joost Vennekens, Marc Denecker: A General Representation and Approximate Inference Algorithm for Sensing Actions. Australasian Conference on Artificial Intelligence 2012: 543-554
- [c80]Marc Denecker, Maurice Bruynooghe, Joost Vennekens: Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs. Correct Reasoning 2012: 178-194
- [c79]Broes de Cat, Marc Denecker, Peter J. Stuckey: Lazy Model Expansion by Incremental Grounding. ICLP (Technical Communications) 2012: 201-211
- [c78]Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens: A Tarskian Informal Semantics for Answer Set Programming. ICLP (Technical Communications) 2012: 277-289
- [c77]Jo Devriendt, Bart Bogaerts, Broes de Cat, Marc Denecker, Christopher Mears: Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT. ICTAI 2012: 49-56
- [c76]Hanne Vlaeminck, Joost Vennekens, Maurice Bruynooghe, Marc Denecker: Ordered Epistemic Logic: Semantics, Complexity and Applications. KR 2012
- [i20]Ping Hou, Johan Wittocx, Marc Denecker: LPC(ID): A Sequent Calculus Proof System for Propositional Logic Extended with Inductive Definitions. CoRR abs/1207.2534 (2012)
- 2011
- [c75]Marc Denecker, Joost Vennekens, Hanne Vlaeminck, Johan Wittocx, Maurice Bruynooghe: Answer Set Programming's Contributions to Classical Logic - An Analysis of ASP Methodology. Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning 2011: 12-32
- [i19]Ofer Arieli, Maurice Bruynooghe, Marc Denecker, Bert Van Nuffelen: Coherent Integration of Databases by Abductive Logic Programming. CoRR abs/1107.0030 (2011)
- [i18]Marc Denecker, Victor W. Marek, Miroslaw Truszczynski: Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too. CoRR abs/1108.3278 (2011)
- [i17]Stef De Pooter, Johan Wittocx, Marc Denecker: A prototype of a knowledge-based programming environment. CoRR abs/1108.5667 (2011)
- 2010
- [j29]Joost Vennekens, Marc Denecker, Maurice Bruynooghe: FO(ID) as an extension of DL with rules. Ann. Math. Artif. Intell. 58(1-2): 85-115 (2010)
- [j28]Johan Wittocx, Maarten Mariën, Marc Denecker: Grounding FO and FO(ID) with Bounds. J. Artif. Intell. Res. (JAIR) 38: 223-269 (2010)
- [j27]Marc Denecker, Alvaro Cortés-Calabuig, Maurice Bruynooghe, Ofer Arieli: Towards a logical reconstruction of a theory for locally closed databases. ACM Trans. Database Syst. 35(3) (2010)
- [j26]Ping Hou, Broes de Cat, Marc Denecker: FO(FD): Extending classical logic with rule-based fixpoint definitions. TPLP 10(4-6): 581-596 (2010)
- [c74]Joost Vennekens, Maurice Bruynooghe, Marc Denecker: Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic. JELIA 2010: 313-325
- [c73]Hanne Vlaeminck, Johan Wittocx, Joost Vennekens, Marc Denecker, Maurice Bruynooghe: An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability Problems. JELIA 2010: 326-338
- [i16]Ping Hou, Broes de Cat, Marc Denecker: FO(FD): Extending classical logic with rule-based fixpoint definitions. CoRR abs/1007.3819 (2010)
- [i15]Johan Wittocx, Marc Denecker, Maurice Bruynooghe: Constraint Propagation for Extended First-Order Logic. CoRR abs/1008.2121 (2010)
2000 – 2009
- 2009
- [j25]Joost Vennekens, Marc Denecker, Maurice Bruynooghe: CP-logic: A language of causal probabilistic events and its relation to logic programming. TPLP 9(3): 245-308 (2009)
- [c72]
- [c71]
- [c70]
- [c69]Johan Wittocx, Broes de Cat, Marc Denecker: Towards Computing Revised Models for FO Theories. INAP 2009: 85-101
- [c68]Ping Hou, Marc Denecker: A Deductive System for FO(ID) Based on Least Fixpoint Logic. LPNMR 2009: 129-141
- [c67]Marc Denecker, Joost Vennekens: Using Lightweight Inference to Solve Lightweight Problems. LPNMR 2009: 619-621
- [c66]Marc Denecker, Joost Vennekens, Stephen Bond, Martin Gebser, Miroslaw Truszczynski: The Second Answer Set Programming Competition. LPNMR 2009: 637-654
- [c65]Hanne Vlaeminck, Joost Vennekens, Marc Denecker: A logical framework for configuration software. PPDP 2009: 141-148
- [i14]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
- [j24]Marc Denecker, Eugenia Ternovska: A logic of nonmonotone inductive definitions. ACM Trans. Comput. Log. 9(2) (2008)
- [c64]
- [c63]Marc Denecker, Joost Vennekens: Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic. ICLP 2008: 71-76
- [c62]
- [c61]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
- [c60]Johan Wittocx, Maarten Mariën, Marc Denecker: Approximate Reasoning in First-Order Logic Theories. KR 2008: 103-112
- [c59]Maarten Mariën, Johan Wittocx, Marc Denecker, Maurice Bruynooghe: SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. SAT 2008: 211-224
- 2007
- [j23]Marc Denecker, Eugenia Ternovska: Inductive situation calculus. Artif. Intell. 171(5-6): 332-360 (2007)
- [j22]Ofer Arieli, Marc Denecker, Maurice Bruynooghe: Distance semantics for database repair. Ann. Math. Artif. Intell. 50(3-4): 389-415 (2007)
- [j21]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)
- [j20]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)
- [j19]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)
- [j18]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe: Well-founded and stable semantics of logic programs with aggregates. TPLP 7(3): 301-353 (2007)
- [c58]Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe: Approximate Query Answering in Locally Closed Databases. AAAI 2007: 397-402
- [c57]Maarten Mariën, Johan Wittocx, Marc Denecker: Integrating Inductive Definitions in SAT. LPAR 2007: 378-392
- [c56]Marc Denecker, Joost Vennekens: Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions. LPNMR 2007: 84-96
- [c55]
- 2006
- [j17]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)
- [j16]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)
- [c54]Johan Wittocx, Joost Vennekens, Maarten Mariën, Marc Denecker, Maurice Bruynooghe: Predicate Introduction Under Stable and Well-Founded Semantics. ICLP 2006: 242-256
- [c53]Ofer Arieli, Marc Denecker, Maurice Bruynooghe: Distance-Based Repairs of Databases. JELIA 2006: 43-55
- [c52]Joost Vennekens, Marc Denecker, Maurice Bruynooghe: Representing Causal Information About a Probabilistic Process. JELIA 2006: 452-464
- [c51]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
- 2005
- [c50]Joost Vennekens, Marc Denecker: An Algebraic Account of Modularity in ID-logic. Answer Set Programming 2005
- [c49]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
- [c48]Maarten Mariën, Rudradeb Mitra, Marc Denecker, Maurice Bruynooghe: Satisfiability Checking for PC(ID). LPAR 2005: 565-579
- [c47]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
- [c46]
- [i13]Marc Denecker, Eugenia Ternovska: A Logic for Non-Monotone Inductive Definitions. CoRR abs/cs/0501025 (2005)
- [i12]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe: Well-founded and Stable Semantics of Logic Programs with Aggregates. CoRR abs/cs/0509024 (2005)
- 2004
- [j15]Marc Denecker, Victor W. Marek, Miroslaw Truszczynski: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Inf. Comput. 192(1): 84-121 (2004)
- [j14]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)
- [c45]Bert Van Nuffelen, Alvaro Cortés-Calabuig, Marc Denecker, Ofer Arieli, Maurice Bruynooghe: Data Integration Using ID-Logic. CAiSE 2004: 67-81
- [c44]Ofer Arieli, Marc Denecker, Bert Van Nuffelen, Maurice Bruynooghe: Database Repair by Signed Formulae. FoIKS 2004: 14-30
- [c43]
- [c42]Maarten Mariën, David Gilis, Marc Denecker: On the Relation Between ID-Logic and Answer Set Programming. JELIA 2004: 108-120
- [c41]
- [c40]
- [c39]Marc Denecker, Eugenia Ternovska: A Logic of Non-monotone Inductive Definitions and Its Modularity Properties. LPNMR 2004: 47-60
- [c38]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe: Partial Stable Models for Logic Programs with Aggregates. LPNMR 2004: 207-219
- [c37]Joost Vennekens, David Gilis, Marc Denecker: Splitting an operator: an algebraic modularity result and its application to auto-epistemic logic. NMR 2004: 400-408
- [i11]Joost Vennekens, David Gilis, Marc Denecker: Splitting an operator: Algebraic modularity results for logics with fixpoint semantics. CoRR cs.AI/0405002 (2004)
- 2003
- [j13]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Uniform semantic treatment of default and autoepistemic logics. Artif. Intell. 143(1): 79-122 (2003)
- [j12]Ofer Arieli, Marc Denecker: Reducing Preferential Paraconsistent Reasoning to Classical Entailment. J. Log. Comput. 13(4): 557-580 (2003)
- [c36]Marc Denecker: What's in a model? Epistemological analysis of Logic Programming. Answer Set Programming 2003
- [c35]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe: Translation of Aggregate Programs to Normal Logic Programs. Answer Set Programming 2003
- 2002
- [c34]Marc Denecker, Antonis C. Kakas: Abduction in Logic Programming. Computational Logic: Logic Programming and Beyond 2002: 402-436
- [c33]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
- [c32]
- [c31]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Ultimate Approximations in Nonmonotonic Knowledge Representation Systems. KR 2002: 177-190
- [c30]David Gilis, Marc Denecker: Compositionally results for stratified nonmonotone operators. NMR 2002: 51-56
- [c29]
- [c28]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
- [i10]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Ultimate approximations in nonmonotonic knowledge representation systems. CoRR cs.AI/0205014 (2002)
- 2001
- [j11]Marc Denecker, Maurice Bruynooghe, V. Wiktor Marek: Logic programming revisited: Logic programs as inductive definitions. ACM Trans. Comput. Log. 2(4): 623-654 (2001)
- [c27]Marc Denecker: On the Epistemological foundations of Logic Programming and its Extensions. Answer Set Programming 2001
- [c26]Marc Denecker, Nikolay Pelov, Maurice Bruynooghe: Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. ICLP 2001: 212-226
- [c25]Antonis C. Kakas, Bert Van Nuffelen, Marc Denecker: A-System: Problem Solving through Abduction. IJCAI 2001: 591-596
- [c24]Ofer Arieli, Bert Van Nuffelen, Marc Denecker, Maurice Bruynooghe: Coherent Composition of Distributed Knowledge-Bases Through Abduction. LPAR 2001: 624-638
- 2000
- [j10]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)
- [j9]Sofie Verbaeten, Marc Denecker, Danny De Schreye: Compositionality of Normal Open Logic Programs. J. Log. Program. 42(3): 151-183 (2000)
- [j8]Marc Denecker, Antonis C. Kakas: Special issue: abductive logic programming. J. Log. Program. 44(1-3): 1-4 (2000)
- [c23]Marc Denecker: Extending Classical Logic with Inductive Definitions. Computational Logic 2000: 703-717
- [c22]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Uniform semantic treatment of default and autoepistemic logic. KR 2000: 74-84
- [c21]Nikolay Pelov, Emmanuel De Mot, Marc Denecker: Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. LPAR 2000: 225-239
- [i9]Marc Denecker, Victor W. Marek, Miroslaw Truszczynski: Uniform semantic treatment of default and autoepistemic logics. CoRR cs.AI/0002002 (2000)
- [i8]Bert Van Nuffelen, Marc Denecker: Problem solving in ID-logic with aggregates: some experiments. CoRR cs.AI/0003030 (2000)
- [i7]Nikolay Pelov, Emmanuel De Mot, Marc Denecker: Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. CoRR cs.AI/0011030 (2000)
- [i6]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)
- [i5]Sven Verdoolaege, Marc Denecker, Frank Van Eynde: Abductive reasoning with temporal information. CoRR cs.CL/0011035 (2000)
- [i4]
- [i3]
- [i2]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker: Detecting Unsolvable Queries for Definite Logic Programs. CoRR cs.LO/0003067 (2000)
1990 – 1999
- 1999
- [j7]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)
- [c20]Sven Verdoolaege, Marc Denecker, Ness Schelkens, Danny De Schreye, Frank Van Eynde: Semantic interpretation of temporal information by abductive inference. CLIN 1999
- [i1]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Fixpoint 3-valued semantics for autoepistemic logic. CoRR cs.LO/9901003 (1999)
- 1998
- [j6]Marc Denecker, Daniele Theseider Dupré, Kristof Van Belleghem: An Inductive Definition Approach to Ramifications. Electron. Trans. Artif. Intell. 2: 25-67 (1998)
- [j5]Marc Denecker, Danny De Schreye: SLDNFA: An Abductive Procedure for Abductive Logic Programs. J. Log. Program. 34(2): 111-167 (1998)
- [c19]Marc Denecker, V. Wiktor Marek, Miroslaw Truszczynski: Fixpoint 3-Valued Semantics for Autoepistemic Logic. AAAI/IAAI 1998: 840-845
- [c18]Marc Denecker: The Well-Founded Semantics Is the Principle of Inductive Definition. JELIA 1998: 1-16
- [c17]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker: Detecting Unsolvable Queries for Definite Logic Programs. PLILP/ALP 1998: 118-133
- 1997
- [j4]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)
- [c16]Kristof Van Belleghem, Marc Denecker, Danny De Schreye: A Strong Correspondence between Description Logics and Open Logic Programming. ICLP 1997: 346-360
- [c15]Sofie Verbaeten, Marc Denecker, Danny De Schreye: Compositionality of Normal Open Logic Programs. ILPS 1997: 371-385
- 1996
- [c14]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
- [c13]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
- [j3]Marc Denecker, Danny De Schreye: Representing Incomplete Knowledge in Abductive Logic Programming. J. Log. Comput. 5(5): 553-577 (1995)
- [j2]Lode Missiaen, Maurice Bruynooghe, Marc Denecker: CHICA, an Abductive Planning System Based on Event Calculus. J. Log. Comput. 5(5): 579-602 (1995)
- [c12]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
- [c11]Kristof Van Belleghem, Marc Denecker, Danny De Schreye: Combining Situation Calculus and Event Calculus. ICLP 1995: 83-97
- [c10]
- [c9]
- 1994
- [j1]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)
- [c8]Kristof Van Belleghem, Marc Denecker, Danny De Schreye: Representing Continuous Change in the Abductive Event Calculus. ICLP 1994: 225-239
- [c7]Kristof Van Belleghem, Marc Denecker, Danny De Schreye: The Abductive Event Calculus as a General Framework for Temporal Databases. ICTL 1994: 301-316
- [c6]Dmitri Boulanger, Maurice Bruynooghe, Marc Denecker: Abstracting s-semantincs Using A Model-Theoretic Approach. PLILP 1994: 432-446
- 1993
- [c5]Marc Denecker, Danny De Schreye: Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. LPNMR 1993: 365-379
- [c4]Marc Denecker, Danny De Schreye: Representing Incomplete Knowledge in Abductive Logic Programming. ILPS 1993: 147-163
- 1992
- [c3]Marc Denecker, Lode Missiaen, Maurice Bruynooghe: Temporal Reasoning with Abductive Event Calculus. ECAI 1992: 384-388
- [c2]Marc Denecker, Danny De Schreye: On the Duality of Abduction and Model Generation. FGCS 1992: 650-657
- [c1]Marc Denecker, Danny De Schreye: SLDNFA: An Abductive Procedure for Normal Abductive Programs. JICSLP 1992: 686-700
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-18 02:18 CEST by the dblp team