Sciweavers

5482 search results - page 113 / 1097
» Logic Programming and Databases
Sort
View
124
Voted
APAL
2005
135views more  APAL 2005»
15 years 2 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
123
Voted
LPAR
1999
Springer
15 years 6 months ago
A Partial Evaluation Framework for Curry Programs
In this work, we develop a partial evaluation technique for residuating functional logic programs, which generalize the concurrent computation models for logic programs with delays...
Elvira Albert, María Alpuente, Michael Hanu...
113
Voted
APLAS
2007
ACM
15 years 6 months ago
Call-by-Name and Call-by-Value in Normal Modal Logic
Abstract. This paper provides a call-by-name and a call-by-value calculus, both of which have a Curry-Howard correspondence to the minimal normal logic K. The calculi are extension...
Yoshihiko Kakutani
118
Voted
DEXAW
2006
IEEE
126views Database» more  DEXAW 2006»
15 years 8 months ago
Consistent Query Answering: Opportunities and Limitations
This paper briefly reviews the recent literature on consistent query answering, an approach to handle database inconsistency in a systematic and logical manner based on the notio...
Jan Chomicki
112
Voted
TOCL
2002
96views more  TOCL 2002»
15 years 2 months ago
On first-order topological queries
One important class of spatial database queries is the class of topological queries, that is, queries invariant under homeomorphisms. Westudy topological queries expressible in th...
Martin Grohe, Luc Segoufin