Sciweavers

395 search results - page 37 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
ACTAC
2002
75views more  ACTAC 2002»
13 years 9 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
ENTCS
2010
130views more  ENTCS 2010»
13 years 7 months ago
Structural Operational Semantics and Modal Logic, Revisited
A previously introduced combination of the bialgebraic approach to structural operational semantics with aic modal logic is re-examined and improved in some aspects. Firstly, a mo...
Bartek Klin
FUIN
2010
158views more  FUIN 2010»
13 years 7 months ago
Cellular Automata, Decidability and Phasespace
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
Klaus Sutner
VLDB
2005
ACM
120views Database» more  VLDB 2005»
14 years 3 months ago
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is adopted by more and more database systems. For an effic...
Jost Enderle, Nicole Schneider, Thomas Seidl
ICLP
1997
Springer
14 years 2 months ago
Automatic Termination Analysis of Logic Programs
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
Naomi Lindenstrauss, Yehoshua Sagiv