| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Marc Denecker Ofer Arieli , Marc Denecker, Bert Van Nuffelen , Maurice Bruynooghe : Database Repair by Signed Formulae. FoIKS 2004 : 14-30 Nikolay Pelov , Marc Denecker, Maurice Bruynooghe : Partial Stable Models for Logic Programs with Aggregates. LPNMR 2004 : 207-219 Marc Denecker, Eugenia Ternovska : A Logic of Non-monotone Inductive Definitions and Its Modularity Properties. LPNMR 2004 : 47-60 Nikolay Pelov , Marc Denecker, Maurice Bruynooghe : Translation of Aggregate Programs to Normal Logic Programs. Answer Set Programming 2003 Marc Denecker: What's in a model? Epistemological analysis of Logic Programming. Answer Set Programming 2003 Marc Denecker, V. Wiktor Marek , Miroslaw Truszczynski : Uniform semantic treatment of default and autoepistemic logics. Artif. Intell. 143 (1): 79-122 (2003) Ofer Arieli , Marc Denecker: Reducing Preferential Paraconsistent Reasoning to Classical Entailment. J. Log. Comput. 13 (4): 557-580 (2003) Marc Denecker, Antonis C. Kakas : Abduction in Logic Programming. Computational Logic: Logic Programming and Beyond 2002 : 402-436 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 Ofer Arieli , Marc Denecker: Modeling Paraconsistent Reasoning by Classical Logic. FoIKS 2002 : 1-14 Marc Denecker, V. Wiktor Marek , Miroslaw Truszczynski : Ultimate Approximations in Nonmonotonic Knowledge Representation Systems. KR 2002 : 177-190 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 Marc Denecker, Nikolay Pelov , Maurice Bruynooghe : Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates. ICLP 2001 : 212-226 Antonis C. Kakas , Bert Van Nuffelen , Marc Denecker: A-System: Problem Solving through Abduction. IJCAI 2001 : 591-596 Ofer Arieli , Bert Van Nuffelen , Marc Denecker, Maurice Bruynooghe : Coherent Composition of Distributed Knowledge-Bases Through Abduction. LPAR 2001 : 624-638 Marc Denecker, Maurice Bruynooghe , V. Wiktor Marek : Logic programming revisited: Logic programs as inductive definitions. ACM Trans. Comput. Log. 2 (4): 623-654 (2001) Marc Denecker: Extending Classical Logic with Inductive Definitions. Computational Logic 2000 : 703-717 Marc Denecker, V. Wiktor Marek , Miroslaw Truszczynski : Uniform semantic treatment of default and autoepistemic logic. KR 2000 : 74-84 Nikolay Pelov , Emmanuel De Mot , Marc Denecker: Logic Programming Approaches for Representing and Solving Constraint Satisfaction Problems: A Comparison. LPAR 2000 : 225-239 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) Sofie Verbaeten , Marc Denecker, Danny De Schreye : Compositionality of Normal Open Logic Programs. J. Log. Program. 42 (3): 151-183 (2000) Marc Denecker, Antonis C. Kakas : Special issue: abductive logic programming. J. Log. Program. 44 (1-3): 1-4 (2000) 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) Marc Denecker, V. Wiktor Marek , Miroslaw Truszczynski : Fixpoint 3-Valued Semantics for Autoepistemic Logic. AAAI/IAAI 1998 : 840-845 Marc Denecker: The Well-Founded Semantics Is the Principle of Inductive Definition. JELIA 1998 : 1-16 Maurice Bruynooghe , Henk Vandecasteele , D. Andre de Waal , Marc Denecker: Detecting Unsolvable Queries for Definite Logic Programs. PLILP/ALP 1998 : 118-133 Marc Denecker, Daniele Theseider Dupré , Kristof Van Belleghem : An Inductive Definition Approach to Ramifications. Electron. Trans. Artif. Intell. 2 : 25-67 (1998) Marc Denecker, Danny De Schreye : SLDNFA: An Abductive Procedure for Abductive Logic Programs. J. Log. Program. 34 (2): 111-167 (1998) Kristof Van Belleghem , Marc Denecker, Danny De Schreye : A Strong Correspondence between Description Logics and Open Logic Programming. ICLP 1997 : 346-360 Sofie Verbaeten , Marc Denecker, Danny De Schreye : Compositionality of Normal Open Logic Programs. ILPS 1997 : 371-385 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) 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 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 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 Kristof Van Belleghem , Marc Denecker, Danny De Schreye : Combining Situation Calculus and Event Calculus. ICLP 1995 : 83-97 Hilde Adé , Marc Denecker: AILP: Abductive Inductive Logic Programming. IJCAI 1995 : 1201-1209 Marc Denecker: A Terminological Interpretation of (Abductive) Logic Programming. LPNMR 1995 : 15-28 Marc Denecker, Danny De Schreye : Representing Incomplete Knowledge in Abductive Logic Programming. J. Log. Comput. 5 (5): 553-577 (1995) Lode Missiaen , Maurice Bruynooghe , Marc Denecker: CHICA, an Abductive Planning System Based on Event Calculus. J. Log. Comput. 5 (5): 579-602 (1995) Kristof Van Belleghem , Marc Denecker, Danny De Schreye : Representing Continuous Change in the Abductive Event Calculus. ICLP 1994 : 225-239 Kristof Van Belleghem , Marc Denecker, Danny De Schreye : The Abductive Event Calculus as a General Framework for Temporal Databases. ICTL 1994 : 301-316 Dmitri Boulanger , Maurice Bruynooghe , Marc Denecker: Abstracting s-semantincs Using A Model-Theoretic Approach. PLILP 1994 : 432-446 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) Marc Denecker, Danny De Schreye : Representing Incomplete Knowledge in Abductive Logic Programming. ILPS 1993 : 147-163 Marc Denecker, Danny De Schreye : Justification Semantics: A Unifiying Framework for the Semantics of Logic Programs. LPNMR 1993 : 365-379 Marc Denecker, Lode Missiaen , Maurice Bruynooghe : Temporal Reasoning with Abductive Event Calculus. ECAI 1992 : 384-388 Marc Denecker, Danny De Schreye : On the Duality of Abduction and Model Generation. FGCS 1992 : 650-657 Marc Denecker, Danny De Schreye : SLDNFA: An Abductive Procedure for Normal Abductive Programs. JICSLP 1992 : 686-700 1 [ 13 ] 2 [ 34 ] [ 37 ] [ 39 ] [ 42 ] [ 48 ] 3 [ 40 ] 4 [ 8 ] [ 9 ] [ 14 ] [ 15 ] [ 17 ] [ 18 ] [ 20 ] [ 22 ] 5 [ 7 ] [ 16 ] 6 [ 3 ] [ 7 ] [ 10 ] [ 16 ] [ 23 ] [ 26 ] [ 29 ] [ 33 ] [ 34 ] [ 36 ] [ 37 ] [ 40 ] [ 45 ] [ 47 ] [ 48 ] 7 [ 16 ] [ 29 ] 8 [ 15 ] [ 17 ] 9 [ 22 ] 10 [ 40 ] 11 [ 29 ] 12 [ 27 ] [ 35 ] [ 41 ] 13 [ 25 ] [ 31 ] [ 33 ] [ 38 ] [ 43 ] 14 [ 29 ] 15 [ 3 ] [ 10 ] 16 [ 30 ] 17 [ 16 ] 18 [ 34 ] [ 35 ] [ 37 ] [ 40 ] [ 48 ] 19 [ 30 ] [ 36 ] [ 45 ] [ 47 ] 20 [ 15 ] [ 17 ] 21 [ 1 ] [ 2 ] [ 4 ] [ 5 ] [ 6 ] [ 8 ] [ 9 ] [ 11 ] [ 14 ] [ 15 ] [ 17 ] [ 18 ] [ 19 ] [ 20 ] [ 21 ] [ 28 ] [ 29 ] 22 [ 46 ] 23 [ 25 ] [ 31 ] [ 38 ] [ 43 ] 24 [ 23 ] [ 26 ] 25 [ 19 ] [ 28 ] 26 [ 23 ] [ 26 ]  ©2004 Association for Computing Machinery |
