Pages that link to "Item:Q543600"
From MaRDI portal
The following pages link to Semantics and complexity of recursive aggregates in answer set programming (Q543600):
Displaying 27 items.
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- A framework for modular ERDF ontologies (Q360258) (← links)
- John McCarthy's legacy (Q543573) (← links)
- Grounded fixpoints and their applications in knowledge representation (Q892232) (← links)
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- Design and results of the Fifth Answer Set Programming Competition (Q899444) (← links)
- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition (Q1621888) (← links)
- The complexity and generality of learning answer set programs (Q1647512) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Fixed point semantics for stream reasoning (Q2046012) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Modular materialisation of Datalog programs (Q2144176) (← links)
- Recursive rules with aggregation: a simple unified semantics (Q2151406) (← links)
- The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference (Q2206456) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← 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)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Simulating Production Rules Using ACTHEX (Q2900521) (← links)
- Stepwise Debugging of Description-Logic Programs (Q2900544) (← links)
- Well-Supported Semantics for Logic Programs with Generalized Rules (Q2900549) (← links)
- Exploiting Unfounded Sets for HEX-Program Evaluation (Q2915067) (← links)
- Vicious Circle Principle and Logic Programs with Aggregates (Q2931266) (← links)
- A compositional typed higher-order logic with definitions (Q5240216) (← links)
- Hybrid planning for challenging construction problems: an answer set programming approach (Q6161492) (← links)