438 search results - page 29 / 88 » On theorem proving in annotated logics |
66
Voted
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
68
Voted
ENTCS
2006
14 years 9 months ago
2006
A compiler that automatically translates recursive function definitions in higher order logic to clocked synchronous hardware is described. Compilation is by mechanised proof in t...
114
click to vote
JAIR
2007
14 years 9 months ago
2007
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
109
Voted
FOSSACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an overview of the Jahob system for modular analysis of data structure properties. Jahob uses a subset of Java as the implementation language and annotations with formu...