5451 search results - page 685 / 1091 » Typed Operational Semantics |
169
click to vote
AAAI
2004
15 years 8 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
164
click to vote
DLT
2006
15 years 8 months ago
2006
ract State Machines Be Useful in Language Theory? Yuri Gurevich a Margus Veanes a Charles Wallace b aMicrosoft Research, Redmond, Washington, USA bMichigan Tech, Houghton, Michigan...
164
Voted
APPINF
2003
15 years 8 months ago
2003
This paper presents an algorithm for recursive data processing in directed graphs. The proposed algorithm applies graph reduction in order to determine both starting points and a ...
213
click to vote
DLT
2003
15 years 8 months ago
2003
A new generalization of context-free grammars is introduced: Boolean grammars allow the use of all set-theoretic operations as an integral part of the formalism of rules. Rigorous...
172
click to vote
DAGSTUHL
1998
15 years 8 months ago
1998
After brie y reviewing the basic notions and terminology of active rules and relating them to production rules and deductive rules, respectively, we survey a number of formal appro...