Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
858
Rewriting Constraint Models with Metamodels
"... An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may require translations between constraint programming languages, transformations of constraint representations, model optimizatio ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may require translations between constraint programming languages, transformations of constraint representations, model
Theory and Practice of Constraint Handling Rules
, 1998
"... Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed for writing user-defined constraints. CHR are essentially a committed-choice language consisting of mu ..."
Abstract
-
Cited by 455 (37 self)
- Add to MetaCart
of multi-headed guarded rules that rewrite constraints into simpler ones until they are solved. In this broad survey we aim at covering all aspects of CHR as they currently present themselves. Going from theory to practice, we will define syntax and semantics for CHR, introduce an important decidable
Graph Rewriting, Constraint Solving and Tiles for Coordinating Distributed Systems
- Applied Categorical Structures
, 1999
"... . In this paper we describe an approach to model the dynamics of distributed systems. For distributed systems we mean systems consisting of concurrent processes communicating via shared ports and posing certain synchronization requirements, via the ports, to the adjacent processes. The basic idea is ..."
Abstract
-
Cited by 19 (15 self)
- Add to MetaCart
is to use graphs to represent states of such systems, and graph rewriting to represent their evolution. The kind of graph rewriting we use is based on simple context-free productions which are however combined by means of a synchronization mechanism. This allows for a good level of expressivity
Bayesian Description Logics. In:
- Proc. of DL’14. CEUR Workshop Proceedings,
, 2014
"... Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints; moda ..."
Abstract
-
Cited by 394 (49 self)
- Add to MetaCart
Abstract This chapter considers, on the one hand, extensions of Description Logics by features not available in the basic framework, but considered important for using Description Logics as a modeling language. In particular, it addresses the extensions concerning: concrete domain constraints
Regular models of phonological rule systems
, 1994
"... This paper presents a set of mathematical and computational tools for manipulating and reasoning about regular languages and regular relations and argues that they provide a solid basis for computational phonology. It shows in detail how this framework applies to ordered sets of context-sensitive re ..."
Abstract
-
Cited by 382 (6 self)
- Add to MetaCart
-sensitive rewriting rules and also to grammars in Koskenniemi's two-level formalism. This analysis provides a common representation of phonological constraints that supports efficient generation and recognition by a single simple interpreter.
Constraint Handling Rules
- Constraint Programming: Basics and Trends, LNCS 910
, 1995
"... . We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of cons ..."
Abstract
-
Cited by 224 (33 self)
- Add to MetaCart
of constraint solvers. In our approach, constraint evaluation is specified using multiheaded guarded clauses called constraint handling rules (CHRs). CHRs define determinate conditional rewrite systems that express how conjunctions of constraints propagate and simplify. In this paper we concentrate on CHRs
Constraint Contextual Rewriting
, 1998
"... We are interested in the problem of integrating decision procedures with rewriting as in many state-of-the-art verication systems. We dene Constraint Contextual Rewriting (CCR) as a generalization of contextual rewriting, whereby the rewriting context is processed by the available decision proced ..."
Abstract
-
Cited by 20 (7 self)
- Add to MetaCart
We are interested in the problem of integrating decision procedures with rewriting as in many state-of-the-art verication systems. We dene Constraint Contextual Rewriting (CCR) as a generalization of contextual rewriting, whereby the rewriting context is processed by the available decision
Query Rewriting with Symmetric Constraints
, 2002
"... We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous information systems. This problem is of high relevance to data integration, as symmetric constraints are essential for dealing with true c ..."
Abstract
-
Cited by 19 (2 self)
- Add to MetaCart
We address the problem of answering queries using expressive symmetric inter-schema constraints which allow to establish mappings between several heterogeneous information systems. This problem is of high relevance to data integration, as symmetric constraints are essential for dealing with true
Termination of Constraint Contextual Rewriting
, 2000
"... The effective integration of decision procedures in formula simplication is a fundamental problem in mechanical verication. The main source of diculty occurs when the decision procedure is asked to solve goals containing symbols which are interpreted for the prover but uninterpreted for the decision ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
for the decision procedure. To cope with the problem, Boyer & Moore proposed a technique, called augmentation, which extends the information available to the decision procedure with suitably selected facts. Constraint Contextual Rewriting (CCR, for short) is an extended form of contextual rewriting which
Constraint multiset rewriting
, 2002
"... Abstract. We investigate model checking of a computation model called Constrained Multiset Rewriting Systems (CMRS). A CMRS operates on configurations which are multisets of monadic predicate symbols, each with an argument ranging over the natural numbers. The transition relation is defined by a fin ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
Abstract. We investigate model checking of a computation model called Constrained Multiset Rewriting Systems (CMRS). A CMRS operates on configurations which are multisets of monadic predicate symbols, each with an argument ranging over the natural numbers. The transition relation is defined by a
Results 1 - 10
of
858
