Reasoning with infinite stable models
From MaRDI portal
Publication:814596
DOI10.1016/J.ARTINT.2004.02.001zbMATH Open1085.68681OpenAlexW2066734765MaRDI QIDQ814596FDOQ814596
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
Logic programmingAnswer set programmingFinitary programsFirst-order nonmonotonic reasoningInfinite domainsStable model semantics
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- The DLV system for knowledge representation and reasoning
- A logic for default reasoning
- Semantical considerations on nonmonotonic logic
- Circumscription - a form of non-monotonic reasoning
- Computing circumscription revisited: A reduction algorithm
- All I know: A study in autoepistemic logic
- Complexity Results for Nonmonotonic Logics
- Analysis on the p-adic superspace. I. Generalized functions: Gaussian distribution
- A sequent calculus for skeptical Default Logic
- Tableaux and sequent calculus for minimal entailment
- Is intractability of nonmonotonic reasoning a real drawback?
- 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
- On the Expressibility of Stable Logic Programming
- Verifying security protocols as planning in logic programming
- Resolution for skeptical stable model semantics
Cited In (28)
- Logic programming with infinite sets
- Domain expansion for ASP-programs with external sources
- Stabilizing mobile philosophers
- External sources of knowledge and value invention in logic programming
- Computable Functions in ASP: Theory and Implementation
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments
- Answer Set Programming: A Primer
- Partial Functions and Equality in Answer Set Programming
- Conceptual logic programs
- A decidable subclass of finitary programs
- Reasoning about actions with Temporal Answer Sets
- Checking termination of bottom-up evaluation of logic programs with function symbols
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics
- Composing Normal Programs with Function Symbols
- Disjunctive ASP with functions: Decidable queries and effective computation
- Title not available (Why is that?)
- On finitely recursive programs
- Erratum to: ``Reasoning with infinite stable models
- On updates of hybrid knowledge bases composed of ontologies and rules
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Weight constraint programs with evaluable functions
- Open answer set programming for the semantic web
- Using linear constraints for logic program termination analysis
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- Index Sets for Finite Normal Predicate Logic Programs with Function Symbols
- Stable inference as intuitionistic validity
- Stable reasoning
Uses Software
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)
