Sciweavers

37 search results - page 7 / 8
» Partial Inversion of Constructor Term Rewriting Systems
Sort
View
CADE
1994
Springer
13 years 10 months ago
Simple Termination Revisited
In this paper we investigate the concept of simple termination. A term rewriting system is called simply terminating if its termination can be proved by means of a simpli cation o...
Aart Middeldorp, Hans Zantema
ENTCS
2006
113views more  ENTCS 2006»
13 years 5 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
ICFP
2002
ACM
14 years 5 months ago
Meta-programming with names and necessity
Meta-programming is a discipline of writing programs in a certain programming language that generate, manipulate or execute programs written in another language. In a typed settin...
Aleksandar Nanevski
FMSB
2008
129views Formal Methods» more  FMSB 2008»
13 years 7 months ago
Rule-Based Modelling, Symmetries, Refinements
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
Vincent Danos, Jérôme Feret, Walter F...
CSCLP
2008
Springer
13 years 7 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin