FLP answer set semantics without circular justifications for general logic programs
From MaRDI portal
Publication:2453743
Recommendations
- Well-supported semantics for logic programs with generalized rules
- The loop formula based semantics of description logic programs
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Justifications for Logic Programs Under Answer Set Semantics
- scientific article; zbMATH DE number 6261542
Cites work
- A Constructive semantic characterization of aggregates in answer set programming
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- Answer set programming and plan generation
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Argumentation in artificial intelligence
- Combining answer set programming with description logics for the semantic web
- Computing ideal sceptical argumentation
- Conflict-driven ASP solving with external sources
- Equilibrium logic
- Exploiting unfounded sets for HEX-program evaluation
- scientific article; zbMATH DE number 5910656 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 2085279 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- Integrating rules and ontologies in the first-order stable model semantics (preliminary report)
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Local Models Semantics, or contextual reasoning = locality + compatibility
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with abstract constraint atoms: the role of computations
- Logic programs with stable model semantics as a constraint programming paradigm
- Logics in Artificial Intelligence
- Modular nonmonotonic logic programming revisited
- Nonmonotonic multi-context systems: a flexible approach for integrating heterogeneous knowledge sources
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the computational cost of disjunctive logic programming: Propositional case
- Pushing Efficient Evaluation of HEX Programs by Modular Decomposition
- Reconciling description logics and rules
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Semantics and complexity of recursive aggregates in answer set programming
- Stable models and circumscription
- The classical decision problem.
- The Description Logic Handbook
- The Semantics of Predicate Logic as a Programming Language
- The strong exponential hierarchy collapses
- Thirteen Definitions of a Stable Model
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(14)- A progression semantics for first-order logic programs
- Fixed point semantics for stream reasoning
- Determining inference semantics for disjunctive logic programs
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Supportedly stable answer sets for logic programs with generalized atoms
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics
- Evaluating epistemic negation in answer set programming
- Argumentation-based semantics for logic programs with first-order formulae
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Complexity and compilation of GZ-aggregates in answer set programming
- A model building framework for answer set programming with external computations
- selp: a single-shot epistemic logic program solver
- scientific article; zbMATH DE number 6261542 (Why is no real title available?)
- Aggregate semantics for propositional answer set programs
This page was built for publication: FLP answer set semantics without circular justifications for general logic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453743)
