2152 search results - page 88 / 431 » On Automating the Calculus of Relations |
86
Voted
CSL
2002
Springer
15 years 15 days ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
104
Voted
CSL
2007
Springer
15 years 6 months ago
2007
Springer
We consider the problem of automating and checking the use of previously proved lemmas in the proof of some main theorem. In particular, we call the collection of such previously p...
102
Voted
IWPC
2003
IEEE
15 years 6 months ago
2003
IEEE
Syntactic and semantic analysis are established topics in the area of compiler construction. Their application to the understanding and restructuring of large software systems rev...
117
click to vote
JANCL
2006
15 years 20 days ago
2006
We describe a relational framework that uniformly supports formalization and automated reasoning in various propositional modal logics. The proof system we propose is a relational ...
104
Voted
JACM
2000
15 years 15 days ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...