DLV Web Page. http://www.dlvsystem.com/dlvsystem/index.php/Home.
Smodels Web Page. http://www.tcs.hut.fi/Software/smodels/.
Foundations of Databases. Addison Wesley, 1995., , and .
LPNMR, pages 311–316, 2011., , , and . Causal Reasoning for Planning and Coordination of Multiple Housekeeping Robots. In
Reasoning with Logic Programming. Springer, 1996. and .
Magic Sets for Disjunctive Datalog Programs. Artificial Intelligence, 187:156–192, 2012., , , and .
Proceedings of the 24th International Conference on Logic Programming, ICLP '08, pages 739–743. Springer-Verlag, 2008., , and . An Implementation of Extended P-Log Using XASP. In
Foundations of Deductive Databases and Logic Programming, pages 89–148, Morgan Kaufmann, 1988., , and . Towards a Theory of Declarative Knowledge. In , editor,
Logic Programming and Negation: A Survey. Journal of Logic Programming, 19:9–71, 1994. and .
A New Definition of SLDNF-Resolution. Journal of Logic Programming, 28:177–190, 1994. and .
The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003., , , , and , editors.
Towards Answer Set Programming with Sorts. In LPNMR, 2013., , and .
PADL'04, Lecture Notes in Artificial Intelligence (LNCS), Jun 2004.. USA-Smart: Improving the Quality of Plans in Answer Set Planning. In
Proceedings of the 9th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'07), volume 3662 of Lecture Notes in Artificial Intelligence, pages 18–30. Springer, 2007.. CR-MODELS: An Inference Engine for CR-Prolog. In , , and , editors,
LPNMR, pages 402–408, 2009.. CR-Prolog as a Specification Language for Constraint Satisfaction Problems. In
Learning and Using Domain-Specific Heuristics in ASP Solvers. AI Communications, 24(2):147–164, 2011..
ICLP (Technical Communications), pages 49–60, 2012.. An Answer Set Solver for Non-Herbrand Programs: Progress Report. In
Diagnostic Reasoning with A-Prolog. Journal of Theory and Practice of Logic Programming (TPLP), 3(4-5):425–461, Jul 2003. and .
AAAI Spring Symposium 2008 on Architectures for Intelligent Theory-Based Agents (AITA08), 2008. and . The AAA Architecture: An Overview. In
Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE'2000), pages 63–72, 2000., , and . A-Prolog as a Tool for Declarative Programming. In
Answer Set Based Design of Knowledge Systems. Annals of Mathematics and Artificial Intelligence, 47: 183–219, 2006., , and .
Twelfth International Conference on the Principles of Knowledge Representation and Reasoning (KR2010), May 2010. and . Formalizing Psychological Knowledge in Answer Set Programming. In
Knowledge Representation, Reasoning, and Declarative Problem Solving. Cambridge University Press, Jan 2003..
Thirteenth International Conference on the Principles of Knowledge Representation and Reasoning (KR2012), 2012. and . Solving Puzzles Described in English by Automated Translation to Answer Set Programming and Learning How to Do that Translation. In
Proceedings of IJCAI-2007, pages 243–249. and . Using the Probabilistic Logic Programming Language P-log for Causal and Counterfactual Reasoning and Non-Naive Conditioning. In
Logic Programming and Knowledge Representation. Journal of Logic Programming, 19(20):73–148, 1994. and .
Workshop on Logic-Based Artificial Intelligence. Kluwer Academic Publishers, 2000. and . Reasoning Agents in Dynamic Domains. In
Probabilistic Reasoning with Answer Sets. TPLP, 9(1):57–144, 2009. and , and .
Defeasible Specifications in Action Theories. In Proceedings of IJCAI-97, pages 1441–1446, 1997. and .
Proceedings of the 2000 KR Conference, pages 311–322, 2000., , and . Formulating Diagnostic Problem Solving Using an Action Language with Narratives and Sensing. In
Proceedings of the Logic in Computer Science Conference, pages 89–97, 1987. and . Minimalism Subsumes Default Logic and Circumscription in Stratified Logic Programming. In
Negation by Default and Unstratifiable Logic Programs. Theoretical Computer Science, 79(1):86–112, 1991. and .
Representation and Inference for Natural Language: A First Course in Computational Semantics. CSLI Publications, 2005. and .
Automatic Music Composition Using Answer Set Programming. TPLP, 11(2-3):397–427, 2011., , , and .
George Boole's Collected Logical Works. Walton and Maberly, 1854.. An Investigation of the Laws of Thought: On Which Are Founded the Mathematical Theories of Logic and Probabilities.
Preferred Answer Sets for Extended Logic Programs. Artificial Intelligence, 109:297–356, 1998. and .
Proceedings of IJCAI-03, pages 867–872. Morgan Kaufmann, 2003., , and . Answer Set Optimization. In
Preferences and Nonmonotonic Reasoning. AI Magazine, 29(4):69–78, 2008., , and .
Proceedings of the 8th European Conference on Artificial Intelligence (JELIA 2002), Sep 2002., , , , , , , , , , , and . The DLV System. In and , editors,
Efficient Top-Down Computation of Queries under the Well-Founded Semantics. Journal of Logic Programming, 24 (3):161–201, 1995., , and .
Answer Set Programming: Advances in Theory and Implementation, volume 142 of CEUR Workshop Proceedings, pages 303–317. CEUR-WS.org, 2005., , and . Modeling Hybrid Domains Using Process Description Language. In
Logic and Data Bases, pages 293–322. Plenum Press, 1978.. Negation as Failure. In and , editors,
Programming in Prolog: Using the ISO Standard (5th ed.). Springer, 2003. and .
A View of the Origins and Development of Prolog. Communications of the ACM, 31(1):26–36, Jan 1988..
History of Programming Languages II, pages 331–367. ACM, 1996. and . The Birth of Prolog. In , and , editors,
ImplementingMathematics with the Nuprl Proof Development System, PRL Project, Cornell University, 1986., , , , , , , , , , , and .
Prolog Programming in Depth. Prentice-Hall, 1997., , and .
Complexity and Expressive Power of Logic Programming. ACM Computing Surveys, 33(3):374–425, Sep 2001., , , and .
A Machine Program for Theorem-Proving. Communications of the ACM, 5(7):394–397, 1962., and .
A Computing Procedure for Quantification Theory. Communications of the ACM, 7:201–215, 1960. and .
Characterizing Diagnoses and Systems. Artificial Intelligence, 56(2-3):197–222, 1992., , and .
A Framework for Compiling Preferences in Logic Programs. Journal of Theory and Practice of Logic Programming (TPLP), 3(2):129–187, 2003., , and .
A Classification and Survey of Preference Handling Approaches in Nonmonotonic Reasoning. Computational Intelligence, 20:308–334, 2004., , , and .
Information Processing Letters, 77(2-4):53–61, 2001. the Spell of Leibniz's Dream.
Proceedings of the 4th European Conference on Planning, volume 1348 of LectureNotes in Artificial Intelligence (LNCS),pages169–181, 1997., , and . Encoding Planning Problems in Nonmonotonic Logic Programs. In
LPNMR, pages 166–180, 1991.. Classifying Semantics of Logic Programs (Extended Abstract). In
TAL: Temporal Action Logics Language Specification and Tutorial. Electronic Transactions on Artificial Intelligence, 2:273–306, 1998., , , and .
Logic Programs with Consistency-Restoring Rules, AAAI 2003 Spring Symposium Series, Mar 2003., , and , editors.
Markov Logic: An Interface Layer for Artificial Intelligence. Morgan & Claypool, 2009. and .
Tight Logic Programs. Theory and Practice of Logic Programming, 3:499–518, 2003. and .
Consistency of Clark's Completion and Existence of Stable Models. Journal of Methods of Logic in Computer Science, 1(1):51–60, 1994..
Logic Programming and Non-monotonic Reasoning – 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings, volume 6645, pages 317–330, 2011., , and . ASPIDE: Integrated Develop-mentEnvironmentforAnswerSet Programming. In
A New Perspective on Stable Models. In IJCAI, pages 372–379, 2007., , and .
Stable Models and Circumscription. Artificial Intelligence, 175:236–263, 2011., , and .
AI Center, SRI International, 1971. and . STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Technical Note 43R,
A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming, 2(4):295–312, 1985..
Euclids Elements. University of Texas at Austin, Institute for Fusion Studies Department of Physics, 2007..
From Frege to Godel: A Source Book in Mathematical Logic, pages 1–82. Harward University Press, 2002 (1879).. Begriffsschrift, a Formal Language, Modeled upon that of Arithmetic, for Pure Thought. In , editor,
ICLP, pages 190–205, 2008., , , , , and . Engineering an Incremental ASP Solver. In
Answer Set Solving in Practice, volume 6 of Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool, 2012., , , and .
A User's Guide to gringo, clasp, clingo, and iclingo. http://potassco.sourceforge., , , , , and .
Proceedings of the Twenty-Seventh Conference on Artificial Intelligence, AAAI'2013. AAAI Press, 2013., , , , , and . Domain-Specific Heuristics in Answer Set Programming. In
LPNMR, pages 266–271, 2007., , and . Grin Go: A New Grounder for Answer Set Programming. In
Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool, Jun 2013, Vol. 7, No. 2, pages 1–141. and .
The Well-Founded Semantics for General Logic Programs. Journal of ACM, 38(3):620–650, 1991., , and .
Proceedings of Sixth National Conference on Artificial Intelligence, pages 207–212, 1987.. On Stratified Autoepistemic Theories. In
Computational Logic: Logic Programming and Beyond, pages 413–451. Springer, 2002.. Representing Knowledge in A-Prolog. In and , editors,
Proceedings of the Second International Workshop on Software Engineering for Answer Set Programming 10, pages 64–78, 2009. and . Yet Another Modular Action Language. In
Some Properties of System Descriptions of ALd. Journal of Applied Non-Classical Logics, 23(1/2):105–120, 2013. and .
Proceedings of ICLP-88, pages 1070–1080, 1988. and . The Stable Model Semantics for Logic Programming. In
Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9(3/4):365–386, 1991. and .
Representing Action and Change by Logic Programs. Journal of Logic Programming, 17(2/3&4):301–321, 1993. and .
Electronic Transactions on AI, 3, 1998. and . Action Languages.
Working Notes of the International Workshop on Nonmonotonic Reasoning (NMR). 2012. and . The Common Core of Action Languages Band C. In
Automated Reasoning: Essays in Honor of Woody Bledsoe, pages 167–180. Springer, 1991., , and . What Are the Limitations of the Situation Calculus? In , editor,
A Tribute to Judea Pearl, pages 337–359. College Publications, 2010. and . Causal and Probabilistic Reasoning in P-log. In , , and , editors,
AAAI Spring 2006 Symposium, 2006., , and . Combining Logical and Probabilistic Reasoning. In
Third International Workshop, LPKR'97, volume 1471 of Lecture Notes in Artificial Intelligence (LNCS), pages 164–224, Oct 1997. and . Reasoning with Prioritized Defaults. In
Automated Planning: Theory and Practice. Morgan Kaufmann, 2004., , and .
Reasoning about Action I: A Possible Worlds Approach. Artificial Intelligence, 35(2):165–195, 1988. and .
Nonmonotonic Causal Theories. Artificial Intelligence, 153:105–140, 2004., , , , and .
Answer Set Programming Based on Propositional Satisfiability. Journal of Automated Reasoning, 36:345–377, 2006., , and .
AAAI/IAAI, pages 623–630, 1998. and . An Action Language Based on Causal Explanation: Preliminary Report. In
On Formally Undecidable Propositions of Principia Mathematica and Related Systems. Dover Publications (1992), 1931..
Proceedings of the 1st International Joint Conference on Artificial Intelligence, IJCAI'69, pages 219–239, San Francisco. Morgan Kaufmann Publishers, 1969.. Application of Theorem Proving to Problem Solving. In
The Application of Theorem-Proving to Question-Answering Systems. Unpublished Doctoral Dissertation, Stanford University, 1969..
Readings in Model-Based Diagnosis. Morgan Kaufmann Publishers, 1992., , and , editors.
Machine Intelligence 4, pages 463–502. Edinburgh University Press, 1969. and . Some Philosophical Problems from the Standpoint of Artificial Intelligence. In and , editors,
Foundations of Geometry. Open Court, 1980 (1899)..
The Ecological Detective. Princeton University Press, 1997. and .
Local Search Algorithms for SAT: An Empirical Evaluation. Journal of Automated Reasoning, 24:421–481, 2000. and .
LPNMR, 2013.. An Application of ASP to the Field of Second Language Acquisition. In
LPNMR, pages 142–154, 2009., , and . Computing Stable Models via Reductions to Difference Logic. In
Probability Theory: The Logic of Science. Cambridge University Press, 2003.
Reasoning about Actions, Narratives and Ramification. Electronic Transactions on Artificial Intelligence, 1:39–72, 1997. and .
E-RES: Reasoning about Actions, Events and Observations. In LPNMR, pages 254–266, 2001., , and .
ECAI, pages 359–363, 1992. and . Planning as Satisfiability. In
Probabilistic Graphical Models: Principles and Techniques. MIT Press, 2009. and .
The Early Years of Logic Programming. Communications of the ACM, 31(1):38–43, January 1988.
Logic for Problem Solving. North-Holland, 1979.
Database Updates in the Event Calculus. Journal of Logic Programming, 12(1):121–146, 1992..
Meta-Logics and Logic Programming, pages 227–242. MIT Press, 1995.. Using Meta-Logic to Reconcile Reactive with Rational Agents. In
Linear Resolution with Selection Function. Artificial Intelligence, 2(3,4):227–260, 1971. and .
A Logic-Based Calculus of Events. New Generation Computing, 4(4):319–340, 1986. and .
Leibniz Selection. Charles Scribner's Sons, 1951..
The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic, 7:499–562, 2006., , , , , , and .
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation. Information and Computation, 135:69–112, 1997., , and .
CMODELS Web Page. http://www.dlvsystem.com/dlvsystem/index.php/. and .
Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'85, pages 121–127. Morgan Kaufmann Publishers, 1985.. Computing Circumscription. In
Answer Set Programming and Plan Generation. Artificial Intelligence, 138:39–54, 2002..
Handbook ofKnowledge Representation, pages 3–88. Elsevier, 2008., , and . Knowledge Representation and Classical Logic. In , , and , editors,
Why Are There So Many Loop Formulas?ACM Transactions of Computational Logic, 7(2):261–268, 2006. and .
Proceedings of IJCAI-95, pages 1985–1993. MorganKaufmann, 1995.. Embracing Causality in Specifying the Indirect Effects of Actions. In , editor,
State Constraints Revisited. Journal of Logic and Computation, 4(5):655–678, 1994. and .
ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers. Artificial Intelligence, 157(1-2):115–137, 2004. and .
KR, 2012., , and . Answer Set Programming via Mixed Integer Programming. In
Foundations of Logic Programming, 2nd edition. Springer Verlag, 1987.
The HiLeX System for Semantic Information Extraction. T. Large-Scale Data- and Knowledge-Centered Systems, 5:91–125, 2012., , , , and .
Introduction to Mathematics of Satisfiability. Chapman & Hall/CRC Studies in Informatics Series. CRC Press, 2009.
ICLP, pages 600–617, 1989., and . The Relationship between Logic Program Semantics and Nonmonotonic Reasoning. In
Nonmonotonic Logics: Context Dependent Reasoning. Springer-Verlag, 1993. and .
The Logic Programming Paradigm: A 25-Year Perspective, pages 375–398. Springer-Verlag, 1999. and . Stable Models and an Alternative Logic Programming Paradigm. In et al., editors,
Semantic Information Processing, pages 403–418. MIT Press, 1959.. Programs with Common Sense. In , editor,
Circumscription – A Form of Non-Monotonic Reasoning. Artificial Intelligence, 13(1-2):27–39, 1980..
Situations, Actions, and Causal Laws. Technical Report Memo 2, Stanford Artificial Intelligence Project, Stanford University, 1983..
Formalizing Common Sense, Papers by John McCarthy, edited by . Ablex, 1990..
Elaboration Tolerance. http://www-formal.stanford.edu/jmc/elaboration/, 1998..
Non-Monotonic Logic I. Artificial Intelligence, 13 (1-2):41–72, 1980., and .
PDDL - The Planning Domain Definition Language. Tech. Rep. CVC TR-98-003/DCS TR-1165, Yale Center for Computational Vision and Control, 1998., , , , , , , and .
Integrating Answer Set Programming and Constraint Logic Programming. Annals of Math and Artificial Intelligence, 53(1-4):251–287, 2008., , and .
Foundations of Logic and Functional Programming, volume 306 of Lecture Notes in Computer Science, pages 141–156, 1988., , and . PAP: A Logic Programming System Based on a Constructive Logic. In
Proceedings of CADE-82, pages 292–308, 1982.. On Indefinite Data Bases and the Closed World Assumption. In
Computational Logic: Logic Programming and Beyond, 2002, pages 472–511. Lecture Notes in Artificial Intelligence, Springer. and . Disjunctive Logic Programming: A Survey and Assesment. In
The Programming System PRIZ. Journal of Symbolic Computation, 5(3):359–375, June 1988. and .
Proceedings of the 8th International Joint Conference on Artificial Intelligence, pages 272–279. Morgan Kaufmann, Aug 1983.Semantical Considerations on Nonmonotonic Logic. In
Commonsense Reasoning. Morgan Kaufmann, 2006.
Logic for Applications. Graduate Texts in Computer Science. Springer-Verlag GmbH, 1997. and .
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence, 25(3-4): 241–273, 1999..
Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97), volume 1265 of Lecture Notes in Artificial Intelligence (LNCS), pages 420–429, 1997. and . Smodels – An Implementation of the Stable Model and Well-Founded Semantics for Normal Logic Programs. In
Extending and Implementing the Stable Model Semantics. Artificial Intelligence, 138(1-2):181–234, Jun 2002., , and .
Shakey the Robot. Technical Report 323, AI Center, SRI International, 1984..
Probabilistic Logic. Artificial Intelligence, 28(1):71–87, 1986.
Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, AAAI 2001 Spring Symposium Series, Mar 2001., , , , and . An A-Prolog Decision Support System for the Space Shuttle. In and , editors,
ASP Modulo CSP: The Clingcon System. TPLP, 12(4-5):485–503, 2012. and .
In Proceedings of NMELP 96, LNCS 1216, pages 57–70. Springer, 1997.. A New Logical Characterisation of Stable Models and Answer Sets. In
Equilibrium Logic. Annals of Math and Artificial Intelligence, 47(1-2): 3–41, 2006..
Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing, 1984..
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988..
Causality: Models, Reasoning, and Inference. Cambridge University Press, 2000..
ADL and the State-Transition Model of Action. Journal of Logic and Computation, 4(5):467–512, 1994.
Modelling Decision Making with Probabilistic Causation. Intelligent Decision Technologies, 4(2):133–148, 2010. and .
Occurrences and Narratives as Constraints in the Branching Structure of the Situation Calculus. Journal of Logic and Computation, 8(6):777–808, 1998..
Reasoning about Time in the Situation Calculus. Annals of Mathematics and Artificial Intelligence, 14(2-4):251–268, 1995. and .
Representing Diagnosis Knowledge. Annals of Mathematics and Artificial Intelligence, 11:33–50, 1994..
Probabilistic Inductive Logic Programming, pages 222–243. Springer, 2008.. The Independent Choice Logic and Beyond. In , editor,
Artificial Intelligence – Foundations of Computational Agents. Cambridge University Press, 2010. and .
Computational Inteligence: A Logical Approach. Oxford University Press, 1998., , and .
Weakly Stratified Logic Programs. Fundamenta Informaticae, XIII:51–65, 1990. and .
On the Declarative and Procedural Semantics of Logic Programs. Journal of Automated Reasoning, 5:167–205, 1995.
Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan Kaufmann, 1988.. On the Declarative Semantics of Deductive Databases and Logic Programs. In , editor,
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, pages 473–484. Morgan Kaufmann Publishers, 1991.. Modeling Rational Agents within a BDI-Architecture. In
Logic and Data Bases, pages 119–140. Plenum Press, 1978.. On Closed World Data Bases. In
Artificial Intelligence, 13(1-2):81–132, 1980.. A Logic for Default Reasoning.
A Theory of Diagnosis from First Principles. Artificial Intelligence, 32:57–95, 1987..
Knowledge in Action – Logical Foundations for Specifying and Implementing Dynamical Systems. MIT Press, Sep 2001..
Team-Building with Answer Set Programming in the Gioia-Tauro Seaport. TPLP, 12(3):361–381, 2012., , , , , , and .
A Machine-Oriented Logic Based on the Resolution Principle. Journal of the ACM, 12(1):23–41, January 1965..
A Procedural Semantics for Well Founded Negation in Logic Programs. Journal of Logic Programming, 13(1):1–22, 1992..
Prioritized Logic Programming and Its Application to Commonsense Reasoning. Artificial Intelligence, 123:185–222, 2000. and .
Features and Fluents (Vol. 1): The Representation of Knowledge about Dynamical Systems. Oxford University Press, 1994..
IJCAI, pages 1330–1339, 1997. and . PRISM: A Language for Symbolic-Statistical Modeling. In
A Circumscriptive Calculus of Events. Artificial Intelligence, 77: 249–284, 1995..
Solving the Frame Problem: A Mathematical Investigation of the Commonsense Law of Inertia. MIT Press, 1997..
Extending and Implementing the Stable Model Semantics. Dissertation, Helsinki University of Technology, 2000..
Proceedings of the First International Workshop on Practical Aspects of Declarative Languages, May 1999. and . Developing a Declarative Rule Language for Applications in Product Configuration. In
Domain-Dependent Knowledge in Answer Set Planning. ACM Transactions on Computational Logic, 7(4):613–657, 2006., , , and .
Knowledge Representation: Logical, Philosophical and Computational Foundations. Brooks/Cole Publishing, 2000.
The Art of Prolog (2nd ed.): Advanced Programming Techniques. MIT Press, 1994. and .
Proceedings of ICLP-95, pages 233–247. 1995. and . Relating Stable Models and AI Planning Domains. In
Implementation of Logical Grounding for Logic Programs with Stable Model Semantics. Technical Report 18, Digital Systems Laboratory, Helsinki University of Technology, 1998..
Introduction to Logic and the Methodology of Deductive Sciences. Dover Publication, 1995 (1941)..
A Theory of Dynamic Diagnosis. LinkopingElectronic Articles in Computer and Information Science, 2(11), 1997..
Action Programming Languages. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan & Claypool Publishers, 2008..
The Mathematics of Inheritance Systems. Research Notes in Artificial Intelligence. Morgan Kaufmann, 1986.
A Conformant Planner Based on Approximation: CpA(H). ACM Transaction on Intelligent Systems and Technology, 4(2), 2013., , , .
LFCS, volume 813 of Lecture Notes in Computer Science. Springer, 1994. and . Representing Null Values in Logic Programming. In and , editors,
IC-AI, pages 403–407, 2006., , and . Generating Cellular Puzzles with Logic Programs. In
Approximation of Action Theories and Its Application to Conformant Planning. Artificial Intelligence, 175(1):79–119, 2011., , , and .
Representing Actions in Logic Programs and Default Theories: A Situation Calculus Approach. Journal of Logic Programming, 31(1-3):245–298, Jun 1997..
Principles of Database and Knowledge-Base Systems. Computer Science Press, 1988.
CP-Logic: A Language of Causal Probabilistic Events and Its Relation to Logic Programming. TPLP, 9 (3):245–308, 2009., , and .
Principia Mathematica, 3 vols. Cambridge University Press, 1910, 1912, 1913. and .
Reasoning about Rational Agents. MIT Press, 2000..
Logic Programming: Proceedings of the Fifth International Conference and Symposium, pages 1666–1687, 1988.. Design and Implementaion of a Logic Based Language for Data Intensive Applications. In and , editors,
Workshopon Answer Set Programming and Other Computing Paradigms (ASPOCP) 2010, 2010.. A New Algorithm for P-log Inference Engine. In
PLOG: Its Algorithms and Applications. PhD thesis, Texas Tech University, College of Engineering, Department of Computer Science, 2012..