Circumscribing embedded implications (without stratifications)

DOI10.1016/0743-1066(93)90036-GMaRDI QIDQ4275263zbMATH OpenFDO

Authors L. Thorne McCarty

Publication date 13 January 1994

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(93)90036-G

zbMATH Keywords

circumscriptionembedded implicationsfinal Kripke modelindefinite reasoning with definite rulesintuitionistic logicnegation-as-failure

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 1090099
• On the relationship between circumscription and negation as failure
• scientific article; zbMATH DE number 640290
• The expressive power of circumscription
• Some computational aspects of circumscription

Cited in

(9)

• On the relationship between circumscription and negation as failure
• Circumscription and implicit definability
• Intuitionistic logic programming for SQL
• scientific article; zbMATH DE number 4137749 (Why is no real title available?)
• Computing protected circumscription
• Clausal intuitionistic logic I. fixed-point semantics
• scientific article; zbMATH DE number 67825 (Why is no real title available?)
• scientific article; zbMATH DE number 1090099 (Why is no real title available?)
• Embedding circumscriptive theories in general disjunctive programs

This page was built for publication: Circumscribing embedded implications (without stratifications)

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