- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Extending and implementing the stable model semantics
Artificial Intelligence 138 (1-2):181-234 (2002)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
A note on the stable model semantics for logic programs.Michael Kaminski - 1997 - Artificial Intelligence 96 (2):467-479.
First-order stable model semantics with intensional functions.Michael Bartholomew & Joohyung Lee - 2019 - Artificial Intelligence 273 (C):56-93.
A model of language learning with semantics and meaning-preserving corrections.Dana Angluin & Leonor Becerra-Bonache - 2017 - Artificial Intelligence 242:23-51.
Meaning postulates and the model-theoretic approach to natural language semantics.Thomas Ede Zimmermann - 1999 - Linguistics and Philosophy 22 (5):529-561.
Computational semantics: an introduction to artificial intelligence and natural language comprehension.Eugene Charniak & Yorick Wilks (eds.) - 1976 - New York: distributors for the U.S.A. and Canada, Elsevier/North Holland.
Basic model theory, Kees Doets.Patrick Blackburn - 1999 - Journal of Logic, Language and Information 8 (2):258-261.
E-type pronouns, DRT, dynamic semantics and the quantifier/variable-binding model.S. J. Barker - 1997 - Linguistics and Philosophy 20 (2):195-228.
Erratum to: Reasoning with infinite stable models [Artificial Intelligence 156 (1) (2004) 75–111].Piero A. Bonatti - 2008 - Artificial Intelligence 172 (15):1833-1835.
Implementing logical connectives in constraint programming.Christopher Jefferson, Neil C. A. Moore, Peter Nightingale & Karen E. Petrie - 2010 - Artificial Intelligence 174 (16-17):1407-1429.
Analytics
Added to PP
2020-12-22
Downloads
21 (#1,049,356)
6 months
3 (#1,061,821)
2020-12-22
Downloads
21 (#1,049,356)
6 months
3 (#1,061,821)
Historical graph of downloads
Citations of this work
Semantics and complexity of recursive aggregates in answer set programming.Wolfgang Faber, Gerald Pfeifer & Nicola Leone - 2011 - Artificial Intelligence 175 (1):278-298.
Conflict-driven answer set solving: From theory to practice.Martin Gebser, Benjamin Kaufmann & Torsten Schaub - 2012 - Artificial Intelligence 187-188 (C):52-89.
Design and results of the Fifth Answer Set Programming Competition.Francesco Calimeri, Martin Gebser, Marco Maratea & Francesco Ricca - 2016 - Artificial Intelligence 231 (C):151-181.
Answer set programming and plan generation.Vladimir Lifschitz - 2002 - Artificial Intelligence 138 (1-2):39-54.
Stable models and circumscription.Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz - 2011 - Artificial Intelligence 175 (1):236-263.
References found in this work
Circumscription — A Form of Non-Monotonic Reasoning.John McCarthy - 1980 - Artificial Intelligence 13 (1-2):27–39.
Applications of Circumscription to Formalizing Common Sense Knowledge.John McCarthy - 1986 - Artificial Intelligence 28 (1):89–116.
Semantic Considerations on nonmonotonic Logic.Robert C. Moore - 1985 - Artificial Intelligence 25 (1):75-94.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8567d8d854-zpjm8 dc2