Sciweavers

254 search results - page 22 / 51
» Answer Sets for Propositional Theories
Sort
View
AI
2005
Springer
14 years 9 months ago
First order LUB approximations: characterization and algorithms
One of the major approaches to approximation of logical theories is the upper and lower bounds approach introduced in (Selman and Kautz, 1991, 1996). In this paper, we address the...
Alvaro del Val
CORR
2002
Springer
141views Education» more  CORR 2002»
14 years 9 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
STANDARDVIEW
1998
102views more  STANDARDVIEW 1998»
14 years 9 months ago
User participation in standards setting - the panacea?
Voluntary standardisation bodies regularly issue calls for increased user participation in their work groups. This paper challenges such calls. It suggests that users are not norm...
Kai Jakobs, Rob Procter, Robin Williams
COSIT
2009
Springer
165views GIS» more  COSIT 2009»
15 years 4 months ago
To Be and Not To Be: 3-Valued Relations on Graphs
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
John G. Stell
99
Voted
DLOG
2008
14 years 12 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer