Sciweavers

Share
LFCS
2009
Springer
9 years 11 months ago
ATL with Strategy Contexts and Bounded Memory
We extend the alternating-time temporal logics ATL and ATL with strategy contexts and memory constraints: the first extension makes strategy quantifiers to not “forget” the s...
Thomas Brihaye, Arnaud Da Costa Lopes, Franç...
LFCS
2009
Springer
9 years 11 months ago
A Bialgebraic Approach to Automata and Formal Language Theory
A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are compatible. Bialgebras are usually studied over a ...
James Worthington
LFCS
2009
Springer
10 years 1 months ago
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
Nicolas Bedon
LFCS
2009
Springer
10 years 1 months ago
Decidability and Undecidability in Probability Logic
We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas ...
Sebastiaan Terwijn
LFCS
2009
Springer
10 years 1 months ago
Positive Fork Graph Calculus
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. ...
Renata P. de Freitas, Sheila R. M. Veloso, Paulo A...
LFCS
2009
Springer
10 years 1 months ago
Product-Free Lambek Calculus Is NP-Complete
In this paper we prove that the derivability problems for productfree Lambek calculus and product-free Lambek calculus allowing empty premises are NP-complete. Also we introduce a...
Yury Savateev
LFCS
2009
Springer
10 years 1 months ago
The Logic of Proofs as a Foundation for Certifying Mobile Computation
We explore an intuitionistic fragment of Art¨emov’s Logic of Proofs as a type system for a programming language for mobile units. Such units consist of both a code and certific...
Eduardo Bonelli, Federico Feller
LFCS
2009
Springer
10 years 1 months ago
Temporalization of Probabilistic Propositional Logic
In this paper we study several properties of the Exogenous Probabilistic Propositional Logic (EPPL), a logic for reasoning about probabilities, with the purpose of introducing a t...
Pedro Baltazar, Paulo Mateus
LFCS
2009
Springer
10 years 1 months ago
A Clausal Approach to Proof Analysis in Second-Order Logic
This work defines an extension CERES2 of the first-order cut-elimination method CERES to the subclass of sequent calculus proofs in second-order logic using quantifier-free comp...
Stefan Hetzl, Alexander Leitsch, Daniel Weller, Br...
books