163 search results - page 24 / 33 » Higher-Order Logic and Theorem Proving for Structured Specif... |
150
click to vote
FROCOS
2000
Springer
15 years 8 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
132
click to vote
ISTA
2004
15 years 5 months ago
2004
Abstract: This paper presents the evidential paradigm of computer-supported mathematical assistance in "doing" mathematics and in reasoning activity. At present, the evid...
153
click to vote
LPAR
2010
Springer
15 years 2 months ago
2010
Springer
By Courcelle's Theorem we know that any property of finite structures definable in monadic second-order logic (MSO) becomes tractable over structures with bounded treewidth. T...
129
click to vote
ECEASST
2006
15 years 4 months ago
2006
We report on the results of a long-term project to formalize the semantics of OCL 2.0 in Higher-order Logic (HOL). The ultimate goal of the project is to provide a formalized, mach...
182
Voted
ERSHOV
2009
Springer
15 years 8 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...