Sciweavers

204 search results - page 13 / 41
» A Connection Based Proof Method for Intuitionistic Logic
Sort
View
AML
2004
96views more  AML 2004»
13 years 7 months ago
Analytic Calculi for Product Logics
Abstract. Product logic is an important t-norm based fuzzy logic with conjunction interpreted as multiplication on the real unit interval [0, 1], while Cancellative hoop logic CHL ...
George Metcalfe, Nicola Olivetti, Dov M. Gabbay
BIRTHDAY
2003
Springer
14 years 25 days ago
A Hierarchical Completeness Proof for Propositional Temporal Logic
Abstract. We present a new proof of axiomatic completeness for Proposition Temporal Logic (PTL) for discrete, linear time for both finite and infinite time (without past-time). T...
Ben C. Moszkowski
GECCO
1999
Springer
106views Optimization» more  GECCO 1999»
13 years 12 months ago
Generating Lemmas for Tableau-based Proof Search Using Genetic Programming
Top-down or analytical provers based on the connection tableau calculus are rather powerful, yet have notable shortcomings regarding redundancy control. A well-known and successfu...
Marc Fuchs, Dirk Fuchs, Matthias Fuchs
POPL
2004
ACM
14 years 8 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
WWW
2005
ACM
14 years 8 months ago
Soundness proof of Z semantics of OWL using institutions
The correctness of the Z semantics of OWL is the theoretical foundation of using software engineering techniques to verify Web ontologies. As OWL and Z are based on different logi...
Dorel Lucanu, Yuan-Fang Li, Jin Song Dong