A note on the stable model semantics for logic programs

DOI10.1016/S0004-3702(97)00058-1MaRDI QIDQ1127348zbMATH OpenFDO

Authors Michael Kaminski

Publication date 13 August 1998

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0004-3702(97)00058-1

zbMATH Keywords

logic programsstable model semanticsHerbrand interpretationsopen default theories

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Semantics in the theory of computing (68Q55)

Recommendations

• scientific article; zbMATH DE number 1368933
• On stable-like semantics for logic programs
• The Stable Models of a Predicate Logic Program
• Logic programs with stable model semantics as a constraint programming paradigm
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• Expressiveness of logic programs under the general stable model semantics
• Contributions to the stable model semantics of logic programs with negation
• scientific article; zbMATH DE number 1114052
• Stable models and their computation for logic programming with inheritance and true negation
• On the existence of stable models of non-stratified logic programs

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 67490 (Why is no real title available?)
• A comparative study of open default theories
• A logic for default reasoning
• A logical framework for default reasoning
• A procedural semantics for well-founded negation in logic programs
• Circumscription - a form of non-monotonic reasoning
• Extensions for open default theories via the domain closure assumption
• General logical databases and programs: Default logic semantics and stratification
• Logic programming and negation: A survey
• Model theory.
• Negation in logic programming
• On the declarative and procedural semantics of logic programs

Cited in

(24)

• Stable models for infinitary formulas with extensional atoms
• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Stable and extension class theory for logic programs and default logics
• scientific article; zbMATH DE number 7047283 (Why is no real title available?)
• scientific article; zbMATH DE number 25193 (Why is no real title available?)
• Stable-unstable semantics: Beyond NP with normal logic programs
• Answer set based design of knowledge systems
• Extending and implementing the stable model semantics
• Default theories over monadic languages
• On the expressibility of stable logic programming
• Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning
• MICAI 2004: Advances in Artificial Intelligence
• Expressiveness of stable model semantics for disjunctive logic programs with functions
• Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
• scientific article; zbMATH DE number 845882 (Why is no real title available?)
• Logic programs with stable model semantics as a constraint programming paradigm
• A model of intuitionistic affine logic from stable domain theory
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• A Free Logic for Stable Models with Partial Intensional Functions
• scientific article; zbMATH DE number 1114054 (Why is no real title available?)
• Logic programming and knowledge representation---The A-Prolog perspective
• On the existence of stable models of non-stratified logic programs
• On the stable model semantics for intensional functions
• Contributions to the stable model semantics of logic programs with negation

This page was built for publication: A note on the stable model semantics for logic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127348)