The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marc Denecker: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  93. Grounding with Bounds. [Citation Graph (, )][DBLP]


  94. FO(ID) as an Extension of DL with Rules. [Citation Graph (, )][DBLP]


  95. Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic. [Citation Graph (, )][DBLP]


  96. Debugging for Model Expansion. [Citation Graph (, )][DBLP]


  97. A Knowledge Base System Project for FO(.). [Citation Graph (, )][DBLP]


  98. An Approximative Inference Method for Solving THERE EXISTS FOR ALL SO Satisfiability Problems. [Citation Graph (, )][DBLP]


  99. Embracing Events in Causal Modelling: Interventions and Counterfactuals in CP-Logic. [Citation Graph (, )][DBLP]


  100. Approximate Reasoning in First-Order Logic Theories. [Citation Graph (, )][DBLP]


  101. Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases. [Citation Graph (, )][DBLP]


  102. Using Lightweight Inference to Solve Lightweight Problems. [Citation Graph (, )][DBLP]


  103. A Deductive System for FO(ID) Based on Least Fixpoint Logic. [Citation Graph (, )][DBLP]


  104. The Second Answer Set Programming Competition. [Citation Graph (, )][DBLP]


  105. A logical framework for configuration software. [Citation Graph (, )][DBLP]


  106. SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions. [Citation Graph (, )][DBLP]


  107. Well-founded and Stable Semantics of Logic Programs with Aggregates [Citation Graph (, )][DBLP]


  108. CP-logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming [Citation Graph (, )][DBLP]


  109. FO(FD): Extending classical logic with rule-based fixpoint definitions [Citation Graph (, )][DBLP]


  110. Constraint Propagation for Extended First-Order Logic [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002