The following pages link to (Q3983043):
Displayed 50 items.
- Ordering default theories and nonmonotonic logic programs (Q557790) (← links)
- A non-ground realization of the stable and well-founded semantics (Q671655) (← links)
- Combining explicit negation and negation by failure via Belnap's logic (Q673380) (← links)
- A first order nonmonotonic extension of constructive logic (Q813086) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Enhancing disjunctive logic programming systems by SAT checkers (Q814529) (← links)
- Towards a general theory of topological maps (Q814534) (← links)
- Nonmonotonic causal theories (Q814551) (← links)
- Reasoning with infinite stable models (Q814596) (← links)
- Answer set based design of knowledge systems (Q854966) (← links)
- Equilibrium logic (Q854969) (← links)
- Possibilistic uncertainty handling for answer set programming (Q854974) (← links)
- Answer set programming based on propositional satisfiability (Q861709) (← links)
- Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation (Q865046) (← links)
- Connectionist modal logic: representing modalities in neural networks (Q870254) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Modeling biological networks by action languages via answer set programming (Q941667) (← links)
- Probabilistic description logic programs (Q997050) (← links)
- My work with Victor Marek: a mathematician looks at answer set programming (Q1028636) (← links)
- Default logic generalized and simplified (Q1028638) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- Integrating answer set programming and constraint logic programming (Q1028649) (← links)
- Inductive situation calculus (Q1028914) (← links)
- Reasoning with minimal models: efficient algorithms and applications (Q1127346) (← links)
- A note on the stable model semantics for logic programs (Q1127348) (← links)
- An operational formal definition of PROLOG: A specification method and its application (Q1186100) (← links)
- A logic of knowledge and justified assumption (Q1199920) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning (Q1311405) (← links)
- Minimal knowledge problem: A new approach (Q1329374) (← links)
- Minimal belief and negation as failure (Q1342215) (← links)
- An alternative approach to the semantics of disjunctive logic programs and deductive databases (Q1344892) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation (Q1363783) (← links)
- On computing minimal models (Q1380414) (← links)
- On extensions of intermediate logics by strong negation (Q1386683) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Abductive reasoning through filtering (Q1575426) (← links)
- Specifying causality in action theories: A default logic approach (Q1575839) (← links)
- Expressing preferences in default logic (Q1589465) (← links)
- Prioritized logic programming and its application to commonsense reasoning (Q1589476) (← links)
- Logic programming and knowledge representation---The A-Prolog perspective (Q1603731) (← links)
- LUPS -- A language for updating logic programs (Q1603734) (← links)
- Yet some more complexity results for default logic (Q1606113) (← links)
- Abduction in logic programming: A new definition and an abductive procedure based on rewriting (Q1614866) (← links)
- On the equivalence and range of applicability of graph-based representations of logic programs. (Q1853147) (← links)
- Relating defeasible and normal logic programming through transformation properties. (Q1853599) (← links)
- Jack Minker --- A profile (Q1924718) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)