1670 search results - page 2 / 334 » On Skolemization in constructive theories |
CAV
2011
Springer
12 years 9 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
AAAI
1990
13 years 6 months ago
1990
We present a strategy for restricting the application of the inference rule paramodulation. The strategy applies to problems in first-order logic with equality and is designed to ...
QSIC
2005
IEEE
13 years 11 months ago
2005
IEEE
Many programs need to access data in a relational database. This is usually done by means of queries written in SQL. Although the language SQL is declarative, certain runtime erro...
MKM
2004
Springer
13 years 11 months ago
2004
Springer
We describe an extension of first-order logic with sequence variables and sequence functions. We define syntax, semantics and inference system for the extension so that Completen...
FROCOS
2009
Springer
14 years 1 days ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...