Reasoning with infinite stable models

DOI10.1016/j.artint.2004.02.001zbMath1085.68681OpenAlexW2066734765MaRDI QIDQ814596

Piero 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 programmingInfinite domainsFinitary programsFirst-order nonmonotonic reasoningStable model semantics

Mathematics Subject Classification ID

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

Related Items (25)

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols ⋮ Reasoning about actions with Temporal Answer Sets ⋮ Conceptual logic programs ⋮ Erratum to: ``Reasoning with infinite stable models ⋮ Open answer set programming for the semantic web ⋮ $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols ⋮ Checking termination of bottom-up evaluation of logic programs with function symbols ⋮ Using linear constraints for logic program termination analysis ⋮ On updates of hybrid knowledge bases composed of ontologies and rules ⋮ Weight constraint programs with evaluable functions ⋮ Unnamed Item ⋮ External sources of knowledge and value invention in logic programming ⋮ Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments ⋮ A decidable subclass of finitary programs ⋮ Disjunctive ASP with functions: Decidable queries and effective computation ⋮ Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics ⋮ On finitely recursive programs ⋮ Answer Set Programming: A Primer ⋮ Answers set programs for non-transferable utility games: expressiveness, complexity and applications ⋮ On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP ⋮ Partial Functions and Equality in Answer Set Programming ⋮ Computable Functions in ASP: Theory and Implementation ⋮ Composing Normal Programs with Function Symbols ⋮ Logic programming with infinite sets ⋮ Domain expansion for ASP-programs with external sources

Uses Software

• Graphplan
• Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tableaux and sequent calculus for minimal entailment
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Computing circumscription revisited: A reduction algorithm
• Is intractability of nonmonotonic reasoning a real drawback?
• Extending and implementing the stable model semantics
• The expressiveness of locally stratified programs
• Logic programming and nonmonotonic reasoning. Proceedings of the 4th international conference, LPNMR '97, held in Dagstuhl, Germany, July 28--31, 1997
• All I know: A study in autoepistemic logic
• Complexity Results for Nonmonotonic Logics
• Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
• Knowledge Representation, Reasoning and Declarative Problem Solving
• A sequent calculus for skeptical Default Logic
• On the Expressibility of Stable Logic Programming
• The DLV system for knowledge representation and reasoning
• Verifying security protocols as planning in logic programming
• Resolution for skeptical stable model semantics

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