enter search term and/or author name
Unfolding partiality and disjunctions in stable model semantics
Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You
This article studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions are unfolded from a logic program so that an implementation of stable models for normal (disjunction-free) programs can be...
Predicate-calculus-based logics for modeling and solving search problems
Deborah East, Miroslaw Truszczyński
The answer-set programming (ASP) paradigm is a way of using logic to solve search problems. Given a search problem, to solve it one designs a logic theory so that models of this theory represent problem solutions. To compute a solution to the...
Complexity results on DPLL and resolution
DPLL and resolution are two popular methods for solving the problem of propositional satisfiability. Rather than algorithms, they are families of algorithms, as their behavior depends on some choices they face during execution: DPLL depends on the...
Monodic temporal resolution
Anatoli Degtyarev, Michael Fisher, Boris Konev
Until recently, First-Order Temporal Logic (FOTL) has been only partially understood. While it is well known that the full logic has no finite axiomatisation, a more detailed analysis of fragments of the logic was not previously available. However, a...
Heterogeneous temporal probabilistic agents
Jürgen Dix, Sarit Kraus, V. S. Subrahmanian
To date, there has been no work on temporal probabilistic agent reasoning on top of heterogeneous legacy databases and software modules. We will define the concept of a heterogeneous temporal probabilistic (HTP) agent. Such agents can be built...