Sciweavers

1391 search results - page 192 / 279
» Completeness of Neighbourhood Logic
Sort
View
JAR
2006
94views more  JAR 2006»
15 years 6 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
CORR
2002
Springer
141views Education» more  CORR 2002»
15 years 6 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
TPHOL
2005
IEEE
15 years 12 months ago
A Structured Set of Higher-Order Problems
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
Christoph Benzmüller, Chad E. Brown
ESOP
2000
Springer
15 years 10 months ago
Compile-Time Debugging of C Programs Working on Trees
We exhibit a technique for automatically verifying the safety of simple C programs working on tree-shaped data structures. We do not consider the complete behavior of programs, but...
Jacob Elgaard, Anders Møller, Michael I. Sc...
ICDE
2006
IEEE
204views Database» more  ICDE 2006»
16 years 7 months ago
Working Models for Uncertain Data
This paper explores an inherent tension in modeling and querying uncertain data: simple, intuitive representations of uncertain data capture many application requirements, but the...
Anish Das Sarma, Omar Benjelloun, Alon Y. Halevy, ...