Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
The conceptual formalism supported by an ontology is not sufficient for handling vague information that is commonly found in many application domains. We describe how to introduce...
The richer data models of object relational databases opens many more options for the logical design of a database schema increasing the complexity of logical database design enorm...
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two...
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...