Extending the stable model semantics with more expressive rules

DOI10.1007/3-540-46767-X_22MaRDI QIDQ4955343zbMATH OpenFDO

Authors Patrik Simons

Publication date 25 May 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46767-X_22

zbMATH Keywords

propositional logic programsstable model semantics

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• Extending and implementing the stable model semantics
• A note on the stable model semantics for logic programs
• R-stable models for logic programs
• Contributions to the stable model semantics of logic programs with negation

Cited in

(9)

• Extending and implementing the stable model semantics
• Concrete results on abstract rules
• Improving the normalization of weight rules in answer set programs
• Back and Forth between Rules and SE-Models
• Integrating rules and ontologies in the first-order stable model semantics (preliminary report)
• Relating constraint answer set programming languages and algorithms
• Cumulativity Tailored for Nonmonotonic Reasoning
• Answer set based design of knowledge systems
• Verification of bounded Petri nets using integer programming

This page was built for publication: Extending the stable model semantics with more expressive rules

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