Sciweavers

3658 search results - page 292 / 732
» The logic of proofs, semantically
Sort
View
ENTCS
2010
120views more  ENTCS 2010»
15 years 6 months ago
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
The validity/satisfiability problem for most propositional interval temporal logics is (highly) undecidable, under very weak assumptions on the class of interval structures in whi...
Davide Bresolin, Dario Della Monica, Valentin Gora...
170
Voted
JCT
2007
107views more  JCT 2007»
15 years 6 months ago
Vertex-minors, monadic second-order logic, and a conjecture by Seese
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
Bruno Courcelle, Sang-il Oum
LOGCOM
1998
122views more  LOGCOM 1998»
15 years 6 months ago
Adding the Everywhere Operator to Propositional Logic
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
David Gries, Fred B. Schneider
FOAL
2009
ACM
15 years 10 months ago
Graph-based specification and simulation of featherweight Java with around advice
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
Tom Staijen, Arend Rensink
CADE
2001
Springer
16 years 7 months ago
Termination and Reduction Checking for Higher-Order Logic Programs
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
Brigitte Pientka