Sciweavers

LICS
2010
IEEE
13 years 2 months ago
A Sound and Complete Calculus for Finite Stream Circuits
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
Stefan Milius
LICS
2010
IEEE
13 years 2 months ago
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Manuel Bodirsky, Martin Hils, Barnaby Martin
16
Voted
LICS
2010
IEEE
13 years 2 months ago
Recursion Schemes and Logical Reflection
Let R be a class of generators of node-labelled infinite trees, and L be a logical language for describing correctness properties of these trees. Given R R and L, we say that R ...
Christopher H. Broadbent, Arnaud Carayol, C.-H. Lu...
LICS
2010
IEEE
13 years 2 months ago
On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures
One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...
Yuguo He
LICS
2010
IEEE
13 years 2 months ago
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications
Abstract--This paper summarizes results on a recently introduced family of Datalog-based languages, called Datalog+/-, which is a new framework for tractable ontology querying, and...
Andrea Calì, Georg Gottlob, Thomas Lukasiew...
LICS
2010
IEEE
13 years 2 months ago
Regular Cost Functions over Finite Trees
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...
Thomas Colcombet, Christof Löding
LICS
2010
IEEE
13 years 2 months ago
The Isomorphism Problem on Classes of Automatic Structures
Several new undecidability results on isomorphism problems for automatic structures are shown: (i) The isomorphism problem for automatic equivalence relations is 0 1complete. (ii)...
Dietrich Kuske, Jiamou Liu, Markus Lohrey
LICS
2010
IEEE
13 years 2 months ago
Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
Martin Grohe
LICS
2010
IEEE
13 years 2 months ago
Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction
ing the differential semantics of rule-based models: exact and automated model reduction (Invited Lecture) Vincent Danos∗§, J´erˆome Feret†, Walter Fontana‡, Russell Harme...
Vincent Danos, Jérôme Feret, Walter F...
LICS
2010
IEEE
13 years 2 months ago
An Extension of Data Automata that Captures XPath
Mikolaj Bojanczyk, Slawomir Lasota