The following pages link to Wolfgang Faber (Q543598):
Displaying 26 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)
- (Q2734932) (← links)
- (Q2767106) (← links)
- Strong Equivalence of Qualitative Optimization Problems (Q2838231) (← links)
- The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics (Q2851230) (← links)
- Look-back Techniques for ASP Programs with Aggregates (Q2895770) (← links)
- Privacy Preservation Using Multi-context Systems and Default Logic (Q2900519) (← links)
- The Intelligent Grounder of DLV (Q2900523) (← links)
- Efficient Computation of the Well-Founded Semantics over Big Data (Q2931253) (← links)
- Manifold Answer-Set Programs and Their Applications (Q3001913) (← links)
- (Q3011297) (← links)
- (Q3112638) (← links)
- Answer Set Programming for Qualitative Spatio-temporal Reasoning: Methods and Experiments (Q5240208) (← links)
- Thirty years of Epistemic Specifications (Q6085582) (← links)
