default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Denecker
Person information
- affiliation: Catholic University of Leuven, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j49]Simon Marynissen, Bart Bogaerts
, Marc Denecker:
Embedding justification theory in approximation fixpoint theory. Artif. Intell. 331: 104112 (2024)- [c112]Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe, Bart Bogaerts, Marc Denecker:
Using Symmetries to Lift Satisfiability Checking. AAAI 2024: 7961-7968 - [c111]Linde Vanbesien, Samuele Pollaci, Bart Bogaerts, Marc Denecker:
Towards a Unifying View on Monotone Constructive Definitions. ISAIM 2024: 218-235 - [c110]Dorde Markovic, Simon Vandevelde, Linde Vanbesien, Joost Vennekens, Marc Denecker:
An epistemic logic for modeling decisions in the context of incomplete knowledge. SAC 2024: 789-793 - [i49]Samuele Pollaci, Babis Kostopoulos, Marc Denecker, Bart Bogaerts:
A Category-Theoretic Perspective on Higher-Order Approximation Fixpoint Theory (Extended Version). CoRR abs/2408.11712 (2024) - 2023
- [j48]Pierre Carbonnelle, Joost Vennekens, Marc Denecker, Bart Bogaerts:
Interactive Model Expansion in an Observable Environment. Theory Pract. Log. Program. 23(4): 648-663 (2023) - [c109]Ruben Lapauw, Maurice Bruynooghe, Marc Denecker:
Justifications and a Reconstruction of Parity Game Solving Algorithms. Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems 2023: 170-187 - [c108]Djordje Markovic, Maurice Bruynooghe, Marc Denecker:
Towards Systematic Treatment of Partial Functions in Knowledge Representation. JELIA 2023: 756-770 - [c107]Pierre Carbonnelle, Matthias van der Hallen, Marc Denecker:
Quantification and aggregation over concepts of the ontology. ICLP 2023: 213-226 - [p3]David Scott Warren, Marc Denecker:
A Better Logical Semantics for Prolog. Prolog: The Next 50 Years 2023: 82-92 - [i48]Marc Denecker, David Scott Warren:
The Logic of Logic Programming. CoRR abs/2304.13430 (2023) - [i47]Pierre Carbonnelle, Joost Vennekens, Bart Bogaerts, Marc Denecker:
Interactive Model Expansion in an Observable Environment. CoRR abs/2305.17140 (2023) - [i46]Marcos Cramer, Pieter Van Hertum, Bart Bogaerts, Marc Denecker:
Distributed Autoepistemic Logic: Semantics, Complexity, and Applications to Access Control. CoRR abs/2306.02774 (2023) - [i45]Pierre Carbonnelle, Gottfried Schenner, Maurice Bruynooghe, Bart Bogaerts, Marc Denecker:
Using Symmetries to Lift Satisfiability Checking. CoRR abs/2311.03424 (2023) - [i44]Dorde Markovic, Simon Vandevelde, Linde Vanbesien, Joost Vennekens, Marc Denecker:
An epistemic logic for modeling decisions in the context of incomplete knowledge. CoRR abs/2312.11186 (2023) - 2022
- [j47]Linde Vanbesien, Maurice Bruynooghe, Marc Denecker:
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory. Theory Pract. Log. Program. 22(4): 523-537 (2022) - [j46]Simon Marynissen, Jesse Heyninck, Bart Bogaerts, Marc Denecker:
On Nested Justification Systems. Theory Pract. Log. Program. 22(5): 641-657 (2022) - [c106]Ðorde Markovic, Simon Vandevelde, Joost Vennekens, Marc Denecker:
On the Semantics of "null" in DMN: Undefined is not Unknown. RuleML+RR (Companion) 2022 - [i43]Pierre Carbonnelle, Simon Vandevelde, Joost Vennekens, Marc Denecker:
IDP-Z3: a reasoning engine for FO(.). CoRR abs/2202.00343 (2022) - [i42]Simon Marynissen, Jesse Heyninck, Bart Bogaerts, Marc Denecker:
On Nested Justification Systems (full version). CoRR abs/2205.04541 (2022) - 2021
- [c105]Simon Marynissen, Bart Bogaerts, Marc Denecker:
On the Relation Between Approximation Fixpoint Theory and Justification Theory. IJCAI 2021: 1973-1980 - [i41]Ruben Lapauw, Maurice Bruynooghe, Marc Denecker:
Justifications and a Reconstruction of Parity Game Solving Algorithms. CoRR abs/2102.01440 (2021) - [i40]Linde Vanbesien, Maurice Bruynooghe, Marc Denecker:
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory. CoRR abs/2104.14789 (2021) - 2020
- [j45]Simon Marynissen, Bart Bogaerts, Marc Denecker:
Exploiting Game Theory for Analysing Justifications. Theory Pract. Log. Program. 20(6): 880-894 (2020) - [c104]Marc Denecker:
On the informal semantics of knowledge representation languages and the case of Logic Programming (invited talk). CILC 2020: 3 - [c103]Ruben Lapauw, Maurice Bruynooghe, Marc Denecker:
Improving Parity Game Solvers with Justifications. VMCAI 2020: 449-470 - [i39]Simon Marynissen, Bart Bogaerts, Marc Denecker:
Exploiting Game Theory for Analysing Justifications. CoRR abs/2008.01609 (2020)
2010 – 2019
- 2019
- [j44]Matthias van der Hallen, Sergey Paramonov, Gerda Janssens, Marc Denecker:
Knowledge representation analysis of graph mining. Ann. Math. Artif. Intell. 86(1-3): 21-60 (2019) - [c102]Pierre Carbonnelle, Bram Aerts, Marjolein Deryck, Joost Vennekens, Marc Denecker:
An Interactive Consultant. BNAIC/BENELEARN 2019 - [c101]Marc Denecker, Bart Bogaerts, Joost Vennekens:
Explaining Actual Causation in Terms of Possible Causal Processes. JELIA 2019: 214-230 - [i38]Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens:
The informal semantics of Answer Set Programming: A Tarskian perspective. CoRR abs/1901.09125 (2019) - 2018
- [j43]Bart Bogaerts, Joost Vennekens, Marc Denecker:
Safe inductions and their applications in knowledge representation. Artif. Intell. 259: 167-185 (2018) - [c100]Ingmar Dasseville, Marc Denecker:
Transpiling Programming Computable Functions to Answer Set Programs. WFLP 2018: 3-17 - [p2]Broes De Cat, Bart Bogaerts, Maurice Bruynooghe, Gerda Janssens, Marc Denecker:
Predicate logic as a modeling language: the IDP system. Declarative Logic Programming 2018: 279-323 - [i37]Ingmar Dasseville, Marc Denecker:
Transpiling Programmable Computable Functions to Answer Set Programs. CoRR abs/1808.07770 (2018) - 2017
- [j42]Pieter Van Hertum, Ingmar Dasseville, Gerda Janssens, Marc Denecker:
The KB paradigm and its application to interactive configuration. Theory Pract. Log. Program. 17(1): 91-117 (2017) - [c99]Bart Bogaerts, Joost Vennekens, Marc Denecker:
Safe Inductions: An Algebraic Study. IJCAI 2017: 859-865 - [i36]Marc Denecker, Bart Bogaerts, Joost Vennekens:
A Logical Study of Some Common Principles of Inductive Definition and its Implications for Knowledge Representation. CoRR abs/1702.04551 (2017) - 2016
- [j41]Maurice Bruynooghe, Marc Denecker, Miroslaw Truszczynski:
First Order Logic with Inductive Definitions for Model-Based Problem Solving. AI Mag. 37(3): 69-80 (2016) - [j40]Bart Bogaerts, Joachim Jansen, Broes De Cat, Gerda Janssens, Maurice Bruynooghe, Marc Denecker:
Bootstrapping Inference in the IDP Knowledge Base System. New Gener. Comput. 34(3): 193-220 (2016) - [j39]Bart Bogaerts, Joost Vennekens, Marc Denecker:
On Well-Founded Set-Inductions and Locally Monotone Operators. ACM Trans. Comput. Log. 17(4): 27 (2016) - [j38]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
On local domain symmetry for model expansion. Theory Pract. Log. Program. 16(5-6): 636-652 (2016) - [c98]Laurent Janssens, Ekaterina Bazhenova, Johannes De Smedt, Jan Vanthienen, Marc Denecker:
Consistent Integration of Decision (DMN) and Process (BPMN) Models. CAiSE Forum 2016: 121-128 - [c97]Marcos Cramer, Pieter Van Hertum, Ruben Lapauw, Ingmar Dasseville, Marc Denecker:
Resilient Delegation Revocation with Precedence for Predecessors Is NP-Complete. CSF 2016: 432-442 - [c96]Ingmar Dasseville, Matthias van der Hallen, Bart Bogaerts, Gerda Janssens, Marc Denecker:
A Compositional Typed Higher-Order Logic with Definitions. ICLP (Technical Communications) 2016: 14:1-14:13 - [c95]Joachim Jansen, Bart Bogaerts, Jo Devriendt, Gerda Janssens, Marc Denecker:
Relevance for SAT(ID). IJCAI 2016: 596-602 - [c94]Pieter Van Hertum, Marcos Cramer, Bart Bogaerts, Marc Denecker:
Distributed Autoepistemic Logic and its Application to Access Control. IJCAI 2016: 1286-1292 - [c93]Pieter Van Hertum, Ingmar Dasseville, Gerda Janssens, Marc Denecker:
The KB Paradigm and Its Application to Interactive Configuration. PADL 2016: 13-29 - [c92]Ingmar Dasseville, Laurent Janssens, Gerda Janssens, Jan Vanthienen, Marc Denecker:
Combining DMN and the Knowledge Base Paradigm for Flexible Decision Enactment. RuleML (Supplement) 2016 - [c91]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
Improved Static Symmetry Breaking for SAT. SAT 2016: 104-122 - [i35]Pieter Van Hertum, Ingmar Dasseville, Gerda Janssens, Marc Denecker:
The KB paradigm and its application to interactive configuration. CoRR abs/1605.01846 (2016) - [i34]Jo Devriendt, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
On Local Domain Symmetry for Model Expansion. CoRR abs/1608.02688 (2016) - [i33]Joachim Jansen, Jo Devriendt, Bart Bogaerts, Gerda Janssens, Marc Denecker:
Implementing a Relevance Tracker Module. CoRR abs/1608.05609 (2016) - 2015
- [j37]Bart Bogaerts, Joost Vennekens, Marc Denecker:
Grounded fixpoints and their applications in knowledge representation. Artif. Intell. 224: 51-71 (2015) - [j36]Broes De Cat, Marc Denecker, Maurice Bruynooghe, Peter J. Stuckey:
Lazy Model Expansion: Interleaving Grounding with Search. J. Artif. Intell. Res. 52: 235-286 (2015) - [j35]Ingmar Dasseville, Matthias van der Hallen, Gerda Janssens, Marc Denecker:
Semantics of templates in a compositional framework for building logics. Theory Pract. Log. Program. 15(4-5): 681-695 (2015) - [j34]Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer:
Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3. Theory Pract. Log. Program. 15(6): 783-817 (2015) - [c90]Bart Bogaerts, Joost Vennekens, Marc Denecker:
Grounded Fixpoints. AAAI 2015: 1453-1459 - [c89]Bart Bogaerts, Joost Vennekens, Marc Denecker:
Partial Grounded Fixpoints. IJCAI 2015: 2784-2790 - [c88]Sergey Paramonov, Matthijs van Leeuwen, Marc Denecker, Luc De Raedt:
An Exercise in Declarative Modeling for Relational Query Mining. ILP 2015: 166-182 - [c87]Marc Denecker, Gerhard Brewka, Hannes Strass:
A Formal Theory of Justifications. LPNMR 2015: 250-264 - [i32]Ingmar Dasseville, Matthias van der Hallen, Gerda Janssens, Marc Denecker:
Semantics of templates in a compositional framework for building logics. CoRR abs/1507.06778 (2015) - [i31]Ruben Lapauw, Ingmar Dasseville, Marc Denecker:
Visualising interactive inferences with IDPD3. CoRR abs/1511.00928 (2015) - 2014
- [j33]Bart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes De Cat, Joost Vennekens, Marc Denecker:
Simulating Dynamic Systems Using Linear Time Calculus Theories. Theory Pract. Log. Program. 14(4-5): 477-492 (2014) - [c86]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
Inference in the FO(C) Modelling Language. ECAI 2014: 111-116 - [c85]Marc Denecker, Joost Vennekens:
The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited. KR 2014 - [i30]Johan Wittocx, Maarten Mariën, Marc Denecker:
Grounding FO and FO(ID) with Bounds. CoRR abs/1401.3840 (2014) - [i29]Broes De Cat, Bart Bogaerts, Maurice Bruynooghe, Marc Denecker:
Predicate Logic as a Modelling Language: The IDP System. CoRR abs/1401.6312 (2014) - [i28]Broes De Cat, Marc Denecker, Peter J. Stuckey, Maurice Bruynooghe:
Lazy Model Expansion: Interleaving Grounding with Search. CoRR abs/1402.6889 (2014) - [i27]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
Inference in the FO(C) Modelling Language. CoRR abs/1404.6368 (2014) - [i26]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
FO(C) and Related Modelling Paradigms. CoRR abs/1404.6394 (2014) - [i25]Bart Bogaerts, Joachim Jansen, Maurice Bruynooghe, Broes De Cat, Joost Vennekens, Marc Denecker:
Simulating dynamic systems using Linear Time Calculus theories. CoRR abs/1405.1523 (2014) - [i24]Marcos Cramer, Pieter Van Hertum, Diego Agustín Ambrossio, Marc Denecker:
Modelling Delegation and Revocation Schemes in IDP. CoRR abs/1405.1584 (2014) - [i23]Bart Bogaerts, Joost Vennekens, Marc Denecker, Jan Van den Bussche:
FO(C): A Knowledge Representation Language of Causality. CoRR abs/1405.1833 (2014) - 2013
- [j32]Johan Wittocx, Marc Denecker, Maurice Bruynooghe:
Constraint Propagation for First-Order Logic and Inductive Definitions. ACM Trans. Comput. Log. 14(3): 17:1-17:45 (2013) - [j31]Pieter Van Hertum, Joost Vennekens, Bart Bogaerts, Jo Devriendt, Marc Denecker:
The effects of buying a new car: an extension of the IDP Knowledge Base System. Theory Pract. Log. Program. 13(4-5-Online-Supplement) (2013) - [c84]Broes De Cat, Bart Bogaerts, Jo Devriendt, Marc Denecker:
Model Expansion in the Presence of Function Symbols Using Constraint Programming. ICTAI 2013: 1068-1075 - [i22]Joost Vennekens, Marc Denecker:
Extending FO(ID) with Knowledge Producing Definitions: Preliminary Results. CoRR abs/1301.1395 (2013) - [i21]Maurice Bruynooghe, Hendrik Blockeel, Bart Bogaerts, Broes De Cat, Stef De Pooter, Joachim Jansen, Anthony Labarre, Jan Ramon, Marc Denecker, Sicco Verwer:
Predicate Logic as a Modeling Language: Modeling and Solving some Machine Learning and Data Mining Problems with IDP3. CoRR abs/1309.6883 (2013) - 2012
- [j30]Hanne Vlaeminck, Joost Vennekens, Marc Denecker, Maurice Bruynooghe:
An approximative inference method for solving ∃∀SO satisfiability problems. J. Artif. Intell. Res. 45: 79-124 (2012) - [c83]Hanne Vlaeminck, Joost Vennekens, Marc Denecker:
A General Representation and Approximate Inference Algorithm for Sensing Actions. Australasian Conference on Artificial Intelligence 2012: 543-554 - [c82]Marc Denecker, Maurice Bruynooghe, Joost Vennekens:
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs. Correct Reasoning 2012: 178-194 - [c81]Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, Sicco Verwer:
Modeling Machine Learning and Data Mining Problems with FO(·). ICLP (Technical Communications) 2012: 14-25 - [c80]Broes De Cat, Marc Denecker, Peter J. Stuckey:
Lazy Model Expansion by Incremental Grounding. ICLP (Technical Communications) 2012: 201-211 - [c79]Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, Joost Vennekens:
A Tarskian Informal Semantics for Answer Set Programming. ICLP (Technical Communications) 2012: 277-289 - [c78]Jo Devriendt, Bart Bogaerts, Broes De Cat, Marc Denecker, Christopher Mears:
Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT. ICTAI 2012: 49-56 - [c77]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
- [c76]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 - [c75]Stef De Pooter, Johan Wittocx, Marc Denecker:
A Prototype of a Knowledge-Based Programming Environment. INAP/WLP 2011: 279-286 - [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. 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): 22:1-22:60 (2010) - [j26]Ping Hou, Broes De Cat, Marc Denecker:
FO(FD): Extending classical logic with rule-based fixpoint definitions. Theory Pract. Log. Program. 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. Theory Pract. Log. Program. 9(3): 245-308 (2009) - [c72]Joost Vennekens, Marc Denecker:
FO(ID) as an Extension of DL with Rules. ESWC 2009: 384-398 - [c71]Marc Denecker:
A Knowledge Base System Project for FO(.). ICLP 2009: 22 - [c70]Johan Wittocx, Hanne Vlaeminck, Marc Denecker:
Debugging for Model Expansion. ICLP 2009: 296-311 - [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): 14:1-14:52 (2008) - [c64]Johan Wittocx, Maarten Mariën, Marc Denecker:
Grounding with Bounds. AAAI 2008: 572-577 - [c63]Marc Denecker, Joost Vennekens:
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic. ICLP 2008: 71-76 - [c62]John S. Schlipf, Marc Denecker:
Complexity of First Order ID-Logic. ISAIM 2008 - [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. Informaticae 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. Informaticae 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): 7 (2007) - [j18]Nikolay Pelov, Marc Denecker, Maurice Bruynooghe:
Well-founded and stable semantics of logic programs with aggregates. Theory Pract. Log. Program. 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]Ping Hou, Johan Wittocx, Marc Denecker:
A Deductive System for PC(ID). LPNMR 2007: 162-174 - 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]Joost Vennekens, Marc Denecker:
An Algebraic Account of Modularity in ID-Logic. LPNMR 2005: 291-303 - [r1]Marc Denecker, Kristof Van Belleghem:
Temporal Reasoning with iff-Abduction. Handbook of Temporal Reasoning in Artificial Intelligence 2005: 343-373 - [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. 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]Joost Vennekens, David Gilis, Marc Denecker:
Splitting an Operator. ICLP 2004: 195-209 - [c42]Maarten Mariën, David Gilis, Marc Denecker:
On the Relation Between ID-Logic and Answer Set Programming. JELIA 2004: 108-120 - [c41]Marc Denecker:
What's in a Model? Epistemological Analysis of Logic Programming. KR 2004: 106-113 - [c40]Marc Denecker, Eugenia Ternovska:
Inductive Situation Calculus. KR 2004: 545-553 - [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]Ofer Arieli, Marc Denecker:
Modeling Paraconsistent Reasoning by Classical Logic. FoIKS 2002: 1-14 - [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]Marc Denecker:
Unifying abductive logic programming and stable logic programming. NMR 2002: 183 - [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]Marc Denecker:
Extending Classical Logic with Inductive Definitions. CoRR cs.LO/0003019 (2000) - [i3]Marc Denecker:
A note on the Declarative reading(s) of Logic Programming. CoRR cs.LO/0003056 (2000) - [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. J. Funct. Log. Program. 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 - [p1]Danny De Schreye, Marc Denecker:
Assessment of Some Issues in CL-Theory and Program Development. The Logic Programming Paradigm 1999: 195-208 - [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]Hilde Adé, Marc Denecker:
AILP: Abductive Inductive Logic Programming. IJCAI 1995: 1201-1209 - [c9]Marc Denecker:
A Terminological Interpretation of (Abductive) Logic Programming. LPNMR 1995: 15-28 - 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
[c112] [c109] [c108] [i45] [j47] [i41] [i40] [c103] [p2] [j41] [j40] [j38] [c91] [i34] [j36] [j34] [j33] [i29] [i28] [i25] [j32] [i21] [j30] [c82] [c81] [c77] [c76] [i19] [j29] [j27] [c74] [c73] [i15] [j25] [i14] [c61] [c59] [j22] [j18] [c58] [j17] [c54] [c53] [c52] [c51] [c49] [c48] [c47] [i12] [j14] [c45] [c44] [c38] [c35] [c33] [c28] [j11] [c26] [c24] [j10] [i2] [j7] [c17] [c13] [j2] [c6] [c3]
[c110] [j48] [i47] [i44] [c106] [i43] [c102] [c101] [i38] [j43] [c99] [i36] [j39] [j37] [c90] [c89] [j33] [c86] [c85] [i27] [i26] [i25] [i23] [j31] [i22] [j30] [c83] [c82] [c79] [c77] [c76] [j29] [c74] [c73] [j25] [c72] [c67] [c66] [c65] [i14] [c63] [j21] [j20] [j19] [c56] [j16] [c54] [c52] [c50] [c46] [c43] [c37] [i11]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
