Sciweavers

2308 search results - page 133 / 462
» Representing Symbolic Reasoning
Sort
View
CSL
2008
Springer
15 years 8 months ago
Quantified Positive Temporal Constraints
Abstract. A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over countable dense linear order witho...
Witold Charatonik, Michal Wrona
CSL
2010
Springer
15 years 6 months ago
Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs
Abstract. We give the first mechanized proof of the fact that for showing termination of a term rewrite system, we may restrict to well-formed terms using just the function symbols...
Christian Sternagel, René Thiemann
AIEDAM
2002
100views more  AIEDAM 2002»
15 years 6 months ago
Drawing marks, acts, and reacts: Toward a computational sketching interface for architectural design
Architects use sketching and diagramming in their design process to perform functional reasoning, formal arrangements, analogy transfer, structure mapping, and knowledge acquisiti...
Ellen Yi-Luen Do
CL
2000
Springer
15 years 6 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
LPAR
2010
Springer
15 years 4 months ago
Interpolating Quantifier-Free Presburger Arithmetic
Craig interpolation has become a key ingredient in many symbolic model checkers, serving as an approximative replacement for expensive quantifier elimination. In this paper, we foc...
Daniel Kroening, Jérôme Leroux, Phili...