Reasoning with infinite stable models

DOI10.1016/J.ARTINT.2004.02.001zbMATH Open1085.68681OpenAlexW2066734765MaRDI QIDQ814596FDOQ814596

Authors P. A. Bonatti

Publication date 7 February 2006

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2004.02.001

zbMATH Keywords

Logic programmingAnswer set programmingFinitary programsFirst-order nonmonotonic reasoningInfinite domainsStable model semantics

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 2090537
• On Finitely Recursive Programs
• On finitely recursive programs
• Erratum to: ``Reasoning with infinite stable models
• A decidable subclass of finitary programs

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 25189 (Why is no real title available?)
• scientific article; zbMATH DE number 25190 (Why is no real title available?)
• scientific article; zbMATH DE number 741348 (Why is no real title available?)
• scientific article; zbMATH DE number 1368933 (Why is no real title available?)
• scientific article; zbMATH DE number 2086511 (Why is no real title available?)
• scientific article; zbMATH DE number 1884395 (Why is no real title available?)
• scientific article; zbMATH DE number 1890624 (Why is no real title available?)
• scientific article; zbMATH DE number 2090537 (Why is no real title available?)
• scientific article; zbMATH DE number 2090855 (Why is no real title available?)
• scientific article; zbMATH DE number 788036 (Why is no real title available?)
• scientific article; zbMATH DE number 1453054 (Why is no real title available?)
• scientific article; zbMATH DE number 1453072 (Why is no real title available?)
• scientific article; zbMATH DE number 3298340 (Why is no real title available?)
• A logic for default reasoning
• A sequent calculus for skeptical Default Logic
• All I know: A study in autoepistemic logic
• Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
• Circumscription - a form of non-monotonic reasoning
• Complexity Results for Nonmonotonic Logics
• Computing circumscription revisited: A reduction algorithm
• Extending and implementing the stable model semantics
• Is intractability of nonmonotonic reasoning a real drawback?
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Logic programming and nonmonotonic reasoning. Proceedings of the 4th international conference, LPNMR '97, held in Dagstuhl, Germany, July 28--31, 1997
• On the Expressibility of Stable Logic Programming
• Resolution for skeptical stable model semantics
• Semantical considerations on nonmonotonic logic
• Tableaux and sequent calculus for minimal entailment
• The DLV system for knowledge representation and reasoning
• The expressiveness of locally stratified programs
• Verifying security protocols as planning in logic programming

Cited in

(34)

• Weight constraint programs with evaluable functions
• External sources of knowledge and value invention in logic programming
• Answers set programs for non-transferable utility games: expressiveness, complexity and applications
• Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
• Index sets for finite normal predicate logic programs with function symbols
• Reasoning about actions with Temporal Answer Sets
• scientific article; zbMATH DE number 2090537 (Why is no real title available?)
• FDNC: decidable nonmonotonic disjunctive logic programs with function symbols
• Automata and Answer Set Programming
• Checking termination of bottom-up evaluation of logic programs with function symbols
• On updates of hybrid knowledge bases composed of ontologies and rules
• Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments
• Logic programming with infinite sets
• Computable Functions in ASP: Theory and Implementation
• Answer Set Programming: A Primer
• Conceptual logic programs
• Stable inference as intuitionistic validity
• Domain expansion for ASP-programs with external sources
• Disjunctive ASP with functions: decidable queries and effective computation
• On Finitely Recursive Programs
• Effectively reasoning about infinite sets in answer set programming
• On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
• Open answer set programming for the semantic web
• Stable reasoning
• Using linear constraints for logic program termination analysis
• Composing Normal Programs with Function Symbols
• A decidable subclass of finitary programs
• $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
• Erratum to: ``Reasoning with infinite stable models
• scientific article; zbMATH DE number 7455702 (Why is no real title available?)
• Stable models for infinitary formulas with extensional atoms
• Partial Functions and Equality in Answer Set Programming
• On finitely recursive programs
• Stabilizing mobile philosophers

Describes a project that uses

Uses Software

• Graphplan
• Datalog

This page was built for publication: Reasoning with infinite stable models

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