research
∙
07/21/2023
Eliminating Unintended Stable Fixpoints for Hybrid Reasoning Systems
A wide variety of nonmonotonic semantics can be expressed as approximato...
share
research
∙
08/05/2022
A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
The logic of hybrid MKNF (minimal knowledge and negation as failure) is ...
research
∙
05/24/2021
Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
Approximation fixpoint theory (AFT) provides an algebraic framework for ...
research
∙
05/11/2020
Restricted Chase Termination for Existential Rules: a Hierarchical Approach and Experimentation
The chase procedure for existential rules is an indispensable tool for s...
research
∙
11/26/2019
Towards Universal Languages for Tractable Ontology Mediated Query Answering
An ontology language for ontology mediated query answering (OMQA-languag...
research
∙
09/18/2019
Mutex Graphs and Multicliques: Reducing Grounding Size for Planning
We present an approach to representing large sets of mutual exclusions, ...
research
∙
07/31/2019
Domain-Independent Cost-Optimal Planning in ASP
We investigate the problem of cost-optimal planning in ASP. Current ASP ...
research
∙
04/25/2019
Characterization of Glue Variables in CDCL SAT Solving
A state-of-the-art criterion to evaluate the importance of a given learn...
research
∙
07/06/2017
Well-Founded Operators for Normal Hybrid MKNF Knowledge Bases
Hybrid MKNF knowledge bases have been considered one of the dominant app...
research
∙
11/19/2014
Existential Rule Languages with Finite Chase: Complexity and Expressiveness
Finite chase, or alternatively chase termination, is an important condit...
research
∙
11/07/2011
Embedding Description Logic Programs into Default Logic
Description logic programs (dl-programs) under the answer set semantics ...
research
∙
04/30/2009
Characterizations of Stable Model Semantics for Logic Programs with Arbitrary Constraint Atoms
This paper studies the stable model semantics of logic programs with (ab...
research
∙
06/21/2000
Verifying Termination of General Logic Programs with Concrete Queries
We introduce a method of verifying termination of logic programs with re...
research
∙
03/09/2000
Linear Tabulated Resolution Based on Prolog Control Strategy
Infinite loops and redundant computations are long recognized open probl...
research
∙
02/27/2000
