60 search results - page 5 / 12 » No complete linear term rewriting system for propositional l... |
208
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
The probability theory is a well-studied branch of mathematics, in order to carry out formal reasoning about probability. Thus, it is important to have a logic, both for computati...
207
click to vote
MCMASTER
1993
15 years 10 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
178
click to vote
JAR
2010
15 years 24 days ago
2010
Nominal logic is a variant of first-order logic with special facilities for reasoning about names and binding based on the underlying concepts of swapping and freshness. It serves ...
157
click to vote
TASE
2008
IEEE
16 years 11 days ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
329
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
Higher-order narrowing is a general method for higher-order equational reasoning and serves for instance as the foundation for the integration of functional and logic programming. ...