Sciweavers

1391 search results - page 181 / 279
» Completeness of Neighbourhood Logic
Sort
View
CADE
2006
Springer
16 years 6 months ago
Importing HOL into Isabelle/HOL
We developed an importer from both HOL 4 and HOL-light into Isabelle/HOL. The importer works by replaying proofs within Isabelle/HOL that have been recorded in HOL 4 or HOL-light a...
Steven Obua, Sebastian Skalberg
CADE
2001
Springer
16 years 6 months ago
Incremental Closure of Free Variable Tableaux
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
Martin Giese
CADE
2001
Springer
16 years 6 months ago
NP-Completeness of Refutability by Literal-Once Resolution
A boolean formula in conjunctive normal form (CNF) F is refuted by literal?once resolution if the empty clause is inferred from F by resolving on each literal of F at most once. Li...
Stefan Szeider
CALCO
2009
Springer
133views Mathematics» more  CALCO 2009»
16 years 27 days ago
Stone Duality and the Recognisable Languages over an Algebra
Abstract. This is a theoretical paper giving the extended Stone duality perspective on the recently discovered connection between duality theory as studied in non-classical logic a...
Mai Gehrke
SFM
2007
Springer
107views Formal Methods» more  SFM 2007»
16 years 12 days ago
A Survey of Markovian Behavioral Equivalences
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...
Marco Bernardo