The following pages link to Wolfgang Faber (Q543598):
Displayed 13 items.
- Synonymous theories and knowledge representations in answer set programming (Q414849) (← links)
- Semantics and complexity of recursive aggregates in answer set programming (Q543600) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Strong order equivalence (Q854968) (← links)
- Magic Sets and their application to data integration (Q882436) (← links)
- Undoing the effects of action sequences (Q946576) (← links)
- Magic sets for disjunctive Datalog programs (Q1761296) (← links)
- Paracoherent answer set computation (Q2238696) (← links)
- Chain answer sets for logic programs with generalized atoms (Q2296731) (← links)
- Algorithm selection for paracoherent answer set computation (Q2296732) (← links)
- Supportedly stable answer sets for logic programs with generalized atoms (Q2360180) (← links)
- Complexity results for answer set programming with bounded predicate arities and implications (Q2426101) (← links)
- On look-ahead heuristics in disjunctive logic programming (Q2426102) (← links)