Sciweavers

1818 search results - page 65 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
BIRTHDAY
2003
Springer
14 years 2 months 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
B
2007
Springer
14 years 3 months ago
Modelling and Proof Analysis of Interrupt Driven Scheduling
Following a brief discussion of uniprocessor scheduling in which we argue the case for formal analysis, we describe a distributed Event B model of interrupt driven scheduling. We ...
Bill Stoddart, Dominique Cansell, Frank Zeyda
LPNMR
2007
Springer
14 years 3 months ago
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
Joohyung Lee, Ravi Palla
ISMVL
2000
IEEE
90views Hardware» more  ISMVL 2000»
14 years 1 months ago
Structures with Many-Valued Information and Their Relational Proof Theory
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
Ivo Düntsch, Wendy MacCaull, Ewa Orlowska
TPHOL
2000
IEEE
14 years 1 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow