Pages that link to "Item:Q3651481"
From MaRDI portal
The following pages link to Modularity Aspects of Disjunctive Stable Models (Q3651481):
Displaying 27 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- An analysis of the equational properties of the well-founded fixed point (Q347388) (← links)
- A framework for modular ERDF ontologies (Q360258) (← links)
- On the input/output behavior of argumentation frameworks (Q464629) (← links)
- On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
- Equivalence between answer-set programs under (partially) fixed input (Q1783736) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- Testing in ASP: revisited language and programming environment (Q2055810) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Graph-based construction of minimal models (Q2093381) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- A general notion of equivalence for abstract argumentation (Q2321336) (← links)
- Parameterized Splitting: A Simple Modification-Based Approach (Q2900508) (← links)
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs (Q2900518) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q2900532) (← links)
- Modular Paracoherent Answer Sets (Q2938513) (← links)
- A Semantic Account for Modularity in Multi-language Modelling of Search Problems (Q3172899) (← links)
- Online Action Language $$o\mathcal {BC}$$+ (Q3449194) (← links)
- ASP Solving for Expanding Universes (Q3449219) (← links)
- A model building framework for answer set programming with external computations (Q4593036) (← links)
- (Q5020984) (← links)
- On Uniform Equivalence of Epistemic Logic Programs (Q5108505) (← links)
- Partial Compilation of ASP Programs (Q5108506) (← links)
- Backdoors to Normality for Disjunctive Logic Programs (Q5277908) (← links)
- Embedding justification theory in approximation fixpoint theory (Q6566637) (← links)
- How to split a logic program (Q6647305) (← links)
