The paper presents an enhancement of xASP, a system that generates
expla...
In imperative programming, the Domain-Driven Design methodology helps in...
In this paper we investigate the relationships between a multipreferenti...
Weighted knowledge bases for description logics with typicality under a
...
In this paper we propose a general approach to define a many-valued
pref...
Extending programming languages with stochastic behaviour such as
probab...
The development of complex software requires tools promoting fail-fast
a...
Answer Set Programming (ASP) emerged in the late 1990ies as a paradigm f...
The pyglaf reasoner takes advantage of circumscription to solve computat...
Modal logic S5 has attracted significant attention and has led to severa...
Qualitative reasoning involves expressing and deriving knowledge based o...
Reasoning over OWL 2 is a very expensive task in general, and therefore ...
Answer Set Programming (ASP) solvers are highly-tuned and complex proced...
Magic sets are a Datalog to Datalog rewriting technique to optimize quer...
Aggregates are among the most frequently used linguistic extensions of a...
Answer Set Programming (ASP) is a logic-based knowledge representation
f...
Spatial information is often expressed using qualitative terms such as
n...
Many practical problems are characterized by a preference relation over
...
Query answering in Answer Set Programming (ASP) is usually solved by
com...
Answer Set Programming (ASP) is logic programming under the stable model...
Answer Set Programming (ASP) is a declarative programming paradigm. The
...
Logic programs with aggregates (LPA) are one of the major linguistic
ext...
In recent years, Answer Set Programming (ASP), logic programming under t...
NP-SPEC is a language for specifying problems in NP in a declarative way...
Datalog is one of the best-known rule-based languages, and extensions of...
In this paper, a new technique for the optimization of (partially) bound...