52 search results - page 8 / 11 » Algorithmic correspondence and completeness in modal logic |
POPL
2008
ACM
14 years 8 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
KRDB
2003
13 years 9 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
TCAD
2008
13 years 7 months ago
2008
Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input corre...
NMR
2004
Springer
14 years 1 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
COCO
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...