Sciweavers

133 search results - page 10 / 27
» Decidable Fragments of Many-Sorted Logic
Sort
View
CADE
2009
Springer
14 years 10 months ago
Decidability Results for Saturation-Based Model Building
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
Matthias Horbach, Christoph Weidenbach
ENTCS
2007
113views more  ENTCS 2007»
13 years 9 months ago
On the Decidability of the Safety Problem for Access Control Policies
An access control system regulates the rights of users to gain access to resources in accordance with a specified policy. The rules in this policy may interact in a way that is n...
E. Kleiner, T. Newcomb
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
FUIN
2007
135views more  FUIN 2007»
13 years 9 months ago
On First-Order Fragments for Mazurkiewicz Traces
Mazurkiewicz traces form a model for concurrency. Temporal logic st-order logic are important tools in order to deal with the abstract behavior of such systems. Since typical prop...
Volker Diekert, Martin Horsch, Manfred Kufleitner
FOSSACS
2006
Springer
14 years 1 months ago
On Metric Temporal Logic and Faulty Turing Machines
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it ...
Joël Ouaknine, James Worrell