Pages that link to "Item:Q5738917"
From MaRDI portal
The following pages link to Strongly equivalent logic programs (Q5738917):
Displaying 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- On abstract modular inference systems and solvers (Q286083) (← links)
- Inductive equivalence in clausal logic and nonmonotonic logic programming (Q413854) (← links)
- Synonymous theories and knowledge representations in answer set programming (Q414849) (← links)
- Characterizing strong equivalence for argumentation frameworks (Q420788) (← links)
- On the input/output behavior of argumentation frameworks (Q464629) (← links)
- On graph equivalences preserved under extensions (Q536221) (← links)
- Stable models and circumscription (Q543596) (← links)
- From answer set logic programming to circumscription via logic of GK (Q543597) (← links)
- Ordering default theories and nonmonotonic logic programs (Q557790) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- First-order satisfiability in Gödel logics: an NP-complete fragment (Q650893) (← links)
- A first order nonmonotonic extension of constructive logic (Q813086) (← links)
- Equivalence issues in abduction and induction (Q833733) (← links)
- Strong order equivalence (Q854968) (← links)
- Equilibrium logic (Q854969) (← links)
- Conceptual logic programs (Q854977) (← links)
- On updates of hybrid knowledge bases composed of ontologies and rules (Q900304) (← links)
- Skepticism relations for comparing argumentation semantics (Q962903) (← links)
- Equivalence for the \(G_3^\prime\)-stable models semantics (Q975880) (← links)
- General default logic (Q987485) (← links)
- Strong equivalence of logic programs under the infinite-valued semantics (Q987828) (← links)
- Default logic generalized and simplified (Q1028638) (← links)
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Safe beliefs for propositional theories (Q1779312) (← links)
- Equivalence between answer-set programs under (partially) fixed input (Q1783736) (← links)
- Dealing with explicit preferences and uncertainty in answer set programming (Q1928820) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- Model reconciliation in logic programs (Q2055814) (← links)
- Choice logics and their computational properties (Q2082503) (← links)
- SAT-based proof search in intermediate propositional logics (Q2104497) (← links)
- An abstract, logical approach to characterizing strong equivalence in non-monotonic knowledge representation formalisms (Q2124445) (← links)
- Towards an answer set programming methodology for constructing programs following a semi-automatic approach -- extended and revised version (Q2133436) (← links)
- An extension of the stable semantics via Lukasiewicz logic (Q2133458) (← links)
- A polynomial reduction of forks into logic programs (Q2144173) (← links)
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility (Q2163881) (← links)
- On the limits of forgetting in answer set programming (Q2211850) (← links)
- Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
- Autoepistemic equilibrium logic and epistemic specifications (Q2307335) (← links)
- Strong inconsistency (Q2321259) (← links)
- Query inseparability for \(\mathcal{ALC}\) ontologies (Q2321290) (← links)
- First-order stable model semantics with intensional functions (Q2321299) (← links)
- Vicious circle principle, aggregates, and formation of sets in ASP based languages (Q2321320) (← links)
- Forgetting auxiliary atoms in forks (Q2321342) (← links)
- Possibilistic nested logic programs and strong equivalence (Q2344722) (← links)
- Redundancy in logic. III: Non-monotonic reasoning (Q2389660) (← links)
- Semantic forgetting in answer set programming (Q2389674) (← links)
- Characterizing causal action theories and their implementations in answer set programming (Q2407453) (← links)
- Infinitary equilibrium logic and strongly equivalent logic programs (Q2407875) (← links)
