Sciweavers

3658 search results - page 457 / 732
» The logic of proofs, semantically
Sort
View
ENTCS
2006
125views more  ENTCS 2006»
15 years 6 months ago
Liveness Checking as Safety Checking for Infinite State Spaces
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
Viktor Schuppan, Armin Biere
ACTAC
2002
75views more  ACTAC 2002»
15 years 6 months ago
Framework for Studying Substitution
This paper describes a framework for handling bound variable renaming and substitution mathematically rigorously with the aim at the same time to stay as close as possible to huma...
Härmel Nestra
186
Voted
APAL
2004
84views more  APAL 2004»
15 years 6 months ago
Finite, integral, and finite-dimensional relation algebras: a brief history
Relation were invented by Tarski and his collaborators in the middle of the twentieth century. The concept of integrality arose naturally early in the history of the subject, and s...
Roger D. Maddux
ANOR
2002
67views more  ANOR 2002»
15 years 6 months ago
An Improved Hybrid Model for the Generic Hoist Scheduling Problem
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
Daniel Riera, Neil Yorke-Smith
141
Voted
JOLLI
2002
92views more  JOLLI 2002»
15 years 6 months ago
A Tableau Method for Graded Intersections of Modalities: A Case for Concept Languages
A concept language with role intersection and number restriction is defined and its modal equivalent is provided. The main reasoning tasks of satisfiability and subsumption checkin...
Ani Nenkova