enter search term and/or author name
Basic theory of feature trees
We present a decision algorithm for the problem Val(FT) of deciding validity of first-order sentences in the theory of feature trees. Its time complexity is exp⌊c·m⌋(c·n) where...
Finite state machines for strings over infinite alphabets
Frank Neven, Thomas Schwentick, Victor Vianu
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite alphabets. These are conservative extensions of classical automata and logics defining the regular languages on finite...
Symbolic semantic rules for producing compact STGLAs from value passing process descriptions
Value passing process algebras with infinite data domains need to be equipped with symbolic semantic models in order for their analysis to be possible. This means that appropriate symbolic models and the related verification algorithms must be...
Termination of simply moded logic programs with dynamic scheduling
Annalisa Bossi, Sandro Etalle, Sabina Rossi, Jan-Georg Smaus
In logic programming, dynamic scheduling indicates the feature by means of which the choice of the atom to be selected at each resolution step is done at runtime and does not follow a fixed selection rule such as the left-to-right one of...
Hypothesis-based semantics of logic programs in multivalued logics
Yann Loyer, Nicolas Spyratos, Daniel Stamate
We address the problem of defining semantics for logic programs in presence of incomplete and contradictory information coming from different sources. The information consists of facts that a central server collects and tries to combine using (a) a...
Reflective metalogical frameworks
David Basin, Manuel Clavel, José Meseguer
A metalogical framework is a logic with an associated methodology that is used to represent other logics and to reason about their metalogical properties. We propose that logical frameworks can be good metalogical frameworks when their theories...