2162 search results - page 170 / 433 » Automated Reasoning on Feature Models |
183
click to vote
ILP
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
183
click to vote
LPKR
1997
Springer
15 years 10 months ago
1997
Springer
Abstract. This paper presents an extension of disjunctive datalog (Datalog∨ ) by nested rules. Nested rules are (disjunctive) rules where elements of the head may be also rules. ...
176
click to vote
LICS
1993
IEEE
15 years 10 months ago
1993
IEEE
traction for a Shared Variable Parallel Language Stephen Brookes∗ School of Computer Science Carnegie Mellon University Pittsburgh, Pa 15213 We give a new denotational semantics...
167
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
175
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
In this paper we study the interaction of subtyping and parametricity. We describe a logic for a programming language with parametric polymorphism and subtyping. The logic support...