Pages that link to "Item:Q814596"
From MaRDI portal
The following pages link to Reasoning with infinite stable models (Q814596):
Displaying 25 items.
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Weight constraint programs with evaluable functions (Q645084) (← links)
- Logic programming with infinite sets (Q812390) (← links)
- Conceptual logic programs (Q854977) (← links)
- Open answer set programming for the semantic web (Q881833) (← links)
- On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
- Sequent calculi for skeptical reasoning in predicate default logic and other nonmonotonic logics (Q1776197) (← links)
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications (Q2060739) (← links)
- Erratum to: ``Reasoning with infinite stable models'' (Q2389687) (← links)
- External sources of knowledge and value invention in logic programming (Q2457798) (← links)
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols (Q3498490) (← links)
- A decidable subclass of finitary programs (Q3585163) (← links)
- Disjunctive ASP with functions: Decidable queries and effective computation (Q3585164) (← links)
- On finitely recursive programs (Q3621269) (← links)
- Answer Set Programming: A Primer (Q3638997) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- (Q5020959) (← links)
- Index Sets for Finite Normal Predicate Logic Programs with Function Symbols (Q5283418) (← links)
- Reasoning about actions with Temporal Answer Sets (Q5299584) (← links)
- Logic programming with function symbols: Checking termination of bottom-up evaluation through program adornments (Q5398308) (← links)
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP (Q5504658) (← links)
- Partial Functions and Equality in Answer Set Programming (Q5504669) (← links)
- Computable Functions in ASP: Theory and Implementation (Q5504670) (← links)
- Composing Normal Programs with Function Symbols (Q5504671) (← links)