The following pages link to (Q4707748):
Displaying 15 items.
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Disjunctive databases for representing repairs (Q987484) (← links)
- Disjunctive logic programs, answer sets, and the cut rule (Q2085572) (← links)
- DiMo -- discrete modelling using propositional logic (Q2118304) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- (Q3413498) (← links)
- (Q4217934) (← links)
- (Q4235437) (← links)
- (Q4798005) (← links)
- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic (Q5096199) (← links)
- Comparisons and computation of well-founded semantics for disjunctive logic programs (Q5277723) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424885) (← links)
- (Q5480653) (← links)
- On measuring inconsistency in definite and indefinite databases with denial constraints (Q6161468) (← links)
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming (Q6566627) (← links)
