325 search results - page 22 / 65 » Extending an Algebraic Modeling Language to Support Constrai... |
APLAS
2003
ACM
14 years 28 days ago
2003
ACM
The chi calculus is studied in the framework incorporating two constructions widely useful in applications: asymmetric communication and mismatch condition. The barbed bisimilarity...
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
We report on recent advancements in the development of grounder Gringo for logic programs under answer set semantics. Like its relatives, DLV and Lparse, Gringo has in the meantime...
CTCS
1997
Springer
13 years 12 months ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
MASCOTS
2003
13 years 9 months ago
2003
Abstract. In this paper we describe a formalism which uses the stochastic process algebra PEPA as the inscription language for labelled stochastic Petri nets. Viewed in another way...