Pages that link to "Item:Q4649729"
From MaRDI portal
The following pages link to Modular Nonmonotonic Logic Programming Revisited (Q4649729):
Displaying 18 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- On abstract modular inference systems and solvers (Q286083) (← links)
- Ordered completion for logic programs with aggregates (Q892233) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- FLP answer set semantics without circular justifications for general logic programs (Q2453743) (← links)
- Promoting modular nonmonotonic logic programs (Q2909170) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- Modularity of P-Log Programs (Q3003239) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Relativized hyperequivalence of logic programs for modular programming (Q3648358) (← links)
- Modularity Aspects of Disjunctive Stable Models (Q3651481) (← links)
- Combining Nonmonotonic Knowledge Bases with External Sources (Q3655190) (← links)
- (Q4537434) (← links)
- Semantics of templates in a compositional framework for building logics (Q4593008) (← links)
- (Q5020984) (← links)
- How to split a logic program (Q6647305) (← links)