4573 search results - page 687 / 915 » Automated Reasoning |
117
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Experiments show that many inequalities involving exponentials and logarithms can be proved automatically by combining a resolution theorem prover with a decision procedu...
148
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
132
Voted
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Permutative logic (PL) is a noncommutative variant of multiplicative linear logic (MLL) arising from recent investigations concerning the topology of linear proofs. Permu...
129
click to vote
LPAR
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world specifications. The idea is to define a decidable subset of m...
116
click to vote
LPNMR
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Most complete answer set solvers are based on DPLL. One of the constraint propagation methods is the so-called lookahead, which has been somewhat controversial, due to it...