2152 search results - page 64 / 431 » On Automating the Calculus of Relations |
88
Voted
LICS
2008
IEEE
15 years 7 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
92
Voted
DBPL
2003
Springer
15 years 5 months ago
2003
Springer
Over the last fifteen years, database management systems (DBMSs) have been enhanced by the addition of rule-based programming to obtain active DBMSs. One of the greatest challeng...
90
Voted
PPDP
2005
Springer
15 years 6 months ago
2005
Springer
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
115
click to vote
CAV
2003
Springer
15 years 5 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
110
click to vote
JLP
2007
15 years 16 days ago
2007
This paper is a further step in exploring the labelled transitions and bisimulations of fusion calculi. We follow a recent theory by the same authors and previously applied to the...