Compiling prioritized circumscription into answer set programming

DOI10.1007/978-3-540-27775-0_25MaRDI QIDQ5313197zbMATH OpenOpenAlexFDO

Authors Toshiko Wakaki, Katsumi Inoue

Publication date 26 August 2005

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

Full work available at URL https://doi.org/10.1007/b99475

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• Embedding prioritized circumscription in logic programs
• scientific article; zbMATH DE number 4106291
• Embedding prioritized circumscription in disjunctive logic programs
• scientific article; zbMATH DE number 4164169

Cited in

(9)

• Computing circumscriptive databases
• scientific article; zbMATH DE number 4164169 (Why is no real title available?)
• Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
• scientific article; zbMATH DE number 4106291 (Why is no real title available?)
• Embedding prioritized circumscription in logic programs
• Embedding prioritized circumscription in disjunctive logic programs
• Model enumeration in propositional circumscription via unsatisfiable core analysis
• Logics in Artificial Intelligence
• Reasoning under minimal upper bounds in propositional logic

This page was built for publication: Compiling prioritized circumscription into answer set programming

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