Sciweavers

2409 search results - page 50 / 482
» On Extended Regular Expressions
Sort
View
125
Voted
ICCS
2000
Springer
15 years 7 months ago
Extending the CG Model by Simulations
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
Jean-François Baget
134
Voted
AAAI
2004
15 years 5 months ago
Extending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a pro...
Nic Wilson
UML
2000
Springer
15 years 7 months ago
Extending OCL to include Actions
The UML's Object Constraint Language provides the modeller of object-oriented systems with ways to express the semantics of a model in a precise and declarative manner. The co...
Anneke Kleppe, Jos Warmer
117
Voted
BIRTHDAY
2004
Springer
15 years 9 months ago
A Proof of Regularity for Finite Splicing
We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.
Vincenzo Manca
GG
2004
Springer
15 years 9 months ago
Extending Graph Rewriting for Refactoring
Refactorings are transformations that change the structure of a program, while preserving the behavior. The topic has attracted a lot of attention recently, since it is a promising...
Niels Van Eetvelde, Dirk Janssens