162 search results - page 7 / 33 » Completeness Guarantees for Incomplete Reasoners |
ICLP
1995
Springer
15 years 1 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
170
click to vote
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
The serious bugs and security vulnerabilities facilitated by C/C++'s lack of bounds checking are well known, yet C and C++ remain in widespread use. Unfortunately, C's a...
103
click to vote
SAT
2005
Springer
15 years 3 months ago
2005
Springer
Solvers for Quantified Boolean Formulae (QBF) use many analogues of technique from SAT. A significant amount of work has gone into extending conflict based techniques such as co...
SARA
2007
Springer
15 years 3 months ago
2007
Springer
Relational databases have had great industrial success in computer science, their power evidenced by theoretical analysis and widespread adoption. Often, automated theorem provers...
CSCLP
2007
Springer
15 years 4 months ago
2007
Springer
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...