Results 21 to 30 of about 759,615 (239)
The complexity of linear-time temporal logic over the class of ordinals [PDF]
Logical Methods in Computer Science, 2010 We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem.
Stephane Demri, Alexander Rabinovich
doaj +1 more source
Expressiveness of Metric modalities for continuous time [PDF]
Logical Methods in Computer Science, 2007 We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by the previous modalities, over the real line, or over the positive reals.
Yoram Hirshfeld, Alexander Rabinovich
doaj +1 more source
Non-Deterministic Kleene Coalgebras [PDF]
Logical Methods in Computer Science, 2010 In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems.
Alexandra Silva +2 more
doaj +1 more source
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness [PDF]
Logical Methods in Computer Science, 2007 We consider Dense-Timed Petri Nets (TPN), an extension of Petri nets in which each token is equipped with a real-valued clock and where the semantics is lazy (i.e., enabled transitions need not fire; time can pass and disable transitions).
Parosh Abdulla +2 more
doaj +1 more source
Lindstrom theorems for fragments of first-order logic [PDF]
Logical Methods in Computer Science, 2009 Lindstr\"om theorems characterize logics in terms of model-theoretic conditions such as Compactness and the L\"owenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic.
Johan van Benthem +2 more
doaj +1 more source
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version) [PDF]
Logical Methods in Computer Science, 2017 We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a 2-categorical sense.
Simon Castellan +2 more
doaj +1 more source
A Logical Foundation for Environment Classifiers [PDF]
Logical Methods in Computer Science, 2010 Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fragments and variable declarations are annotated, and their ...
Takeshi Tsukada, Atsushi Igarashi
doaj +1 more source
Formalization of Abstract State Transition Systems for SAT [PDF]
Logical Methods in Computer Science, 2011 We present a formalization of modern SAT solvers and their properties in a form of abstract state transition systems. SAT solving procedures are described as transition relations over states that represent the values of the solver's global variables ...
Filip Maric, Predrag Janicic
doaj +1 more source
First-order query evaluation on structures of bounded degree [PDF]
Logical Methods in Computer Science, 2011 We consider the enumeration problem of first-order queries over structures of bounded degree. It was shown that this problem is in the Constant-Delaylin class. An enumeration problem belongs to Constant-Delaylin if for an input of size n it can be solved
Wojciech Kazana, Luc Segoufin
doaj +1 more source
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
Logical Methods in Computer Science, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Jean-Philippe Bernardy, Patrik Jansson
doaj +1 more source