1322 search results - page 143 / 265 » Unsound Theorem Proving |
CSL
2003
Springer
14 years 4 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
STACS
2010
Springer
14 years 4 months ago
2010
Springer
In this paper, we focus our attention on the interval temporal logic of the Allen’s relations “meets”, “begins”, and “begun by” (ABB for short), interpreted over natu...
POPL
2000
ACM
14 years 3 months ago
2000
ACM
In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la L´evy) cannot be bound by any elementary function in the number o...
ALP
1990
Springer
14 years 3 months ago
1990
Springer
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
ATVA
2006
Springer
14 years 2 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...