Sciweavers

201 search results - page 22 / 41
» Merging Logic Programs under Answer Set Semantics
Sort
View
LPNMR
2009
Springer
14 years 3 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
IJCAI
2001
13 years 10 months ago
A Comparative Study of Logic Programs with Preference
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
Torsten Schaub, Kewen Wang
EUROCAST
2007
Springer
133views Hardware» more  EUROCAST 2007»
14 years 15 days ago
Temporal Equilibrium Logic: A First Approach
In this paper we introduce an extension of Equilibrium Logic (a logical characterisation of the Answer Set Semantics for logic programs) consisting in the inclusion of modal tempor...
Pedro Cabalar, Gilberto Pérez Vega
AMAI
2008
Springer
13 years 8 months ago
Set based logic programming
In a previous paper [BMR01], the authors showed that the mechanism underlying Logic Programming can be extended to handle the situation where the atoms are interpreted as subsets o...
Howard A. Blair, Victor W. Marek, Jeffrey B. Remme...
AGP
1997
IEEE
14 years 26 days ago
Safe Folding/Unfolding with Conditional Narrowing
Abstract. Functional logic languages with a complete operational semantics are based on narrowing, a generalization of term rewriting where unification replaces matching. In this ...
María Alpuente, Moreno Falaschi, Giné...