Pages that link to "Item:Q2453743"
From MaRDI portal
The following pages link to FLP answer set semantics without circular justifications for general logic programs (Q2453743):
Displaying 13 items.
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- A progression semantics for first-order logic programs (Q1680677) (← links)
- Fixed point semantics for stream reasoning (Q2046012) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (Q2851230) (← links)
- Argumentation-Based Semantics for Logic Programs with First-Order Formulae (Q4571139) (← links)
- Rewriting recursive aggregates in answer set programming: back to monotonicity (Q4592997) (← links)
- Complexity and compilation of GZ-aggregates in answer set programming (Q4592998) (← links)
- A model building framework for answer set programming with external computations (Q4593036) (← links)
- selp: <i>A Single-Shot Epistemic Logic Program Solver</i> (Q4957201) (← links)
- (Q5398061) (← links)