The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration, and the main international projects investigating the potential of the system for industrial exploitation are described.Expand

A precise picture of the complexity of deciding strong and weak answer set existence for a dl-program is given, and the (unique) minimal Herbrand model semantics of positive and stratified dL-programs are generalized.Expand

The Fréchet distance between two curves in a metric space is a measure of the similarity between the curves. We present a discrete variation of this measure. It provides good approximations of the… Expand

This article surveys various complexity and expressiveness results on different forms of logic programming, in particular, propositional logic programming and datalog, but it also mentions general logic programming with function symbols.Expand

This paper shows that the consistency check is Σ2p-complete for the disjunctive stable model semantics, the iterated closed world assumption, and the perfect model semantics; analogous results are derived for the answer sets semantics of extendeddisjunctive logic programs.Expand

A general framework for multi-context reasoning which allows us to combine arbitrary monotonic and nonmonotonic logics and investigates several notions of equilibrium representing acceptable belief states for the authors' multi- context systems.Expand

The complexity of several recently proposed methods for updating or revising propositional knowledge bases is studied to derive complexity results for the following problem: given a knowledge base T, an update p, and a formula q, decide whether q is derivable from Top.Expand

Two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, are considered and their significance for several search problems in applied computer science is discussed.Expand

This paper addresses the issue of how Gelfond and Lifschitz's answer set semantics for extended logic programs can be suitably modified to handle prioritized programs, and defines a strong and a weak notion of preferred answer sets.Expand