4573 search results - page 681 / 915 » Automated Reasoning |
142
Voted
TPHOL
2007
IEEE
15 years 10 months ago
2007
IEEE
In Mizar, unlike in most other proof assistants, the types are not part of the foundations of the system. Mizar is based on untyped set theory, which means that in Mizar expression...
111
Voted
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. By introducing a parallel extension rule that is aware of independence of the introduced extension variables, a calculus for quantified propositional logic is obtained w...
120
Voted
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
81
Voted
CSL
2007
Springer
15 years 10 months ago
2007
Springer
We define a notion of relational linear combinatory algebra (rLCA) which is a generalization of a linear combinatory algebra defined by Abramsky, Haghverdi and Scott. We also de...
150
Voted
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Calculi with explicit substitutions (ES) are widely used in different areas of computer science. Complex systems with ES were developed these last 15 years to capture the good comp...