5482 search results - page 58 / 1097 » Logic Programming and Databases |
ASP
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We define a translation of aggregate programs to normal logic programs which preserves the set of partial stable models. We then define the classes of definite and str...
ADC
2006
Springer
15 years 3 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...
107
click to vote
ESOP
1999
Springer
15 years 2 months ago
1999
Springer
This paper presents the rst approximation method of the nite-failure set of a logic program by set-based analysis. In a dual view, the method yields a type analysis for programs wi...
ICALP
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. The HalpernShoham logic is a modal logic of time intervals. Some eort has been put in last ten years to classify fragments of this beautiful logic with respect to decid...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...