778 search results - page 78 / 156 » Expressiveness and complexity of graph logic |
113
Voted
LOGCOM
2007
15 years 11 days ago
2007
In Artificial Intelligence there is a need for reasoning about continuous processes, where assertions refer to time intervals rather than time points. Taking our lead from van Ben...
171
click to vote
POPL
2011
ACM
14 years 3 months ago
2011
ACM
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data” logic) f...
118
click to vote
CADE
2005
Springer
16 years 24 days ago
2005
Springer
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
124
Voted
ESOP
2006
Springer
15 years 4 months ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
189
Voted
AGP
2010
IEEE
15 years 5 months ago
2010
IEEE
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently use...