3342 search results - page 294 / 669 » Automating Abstract Interpretation |
144
click to vote
ILP
1997
Springer
15 years 8 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...
146
click to vote
LPKR
1997
Springer
15 years 8 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. ...
158
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
Relational languages such as Ruby are used to derive circuits from abstract speci cations of their behaviour. Much reasoning is done informally in Ruby using pictorial representat...
156
click to vote
CCL
1994
Springer
15 years 8 months ago
1994
Springer
Abstract: This paper describes the application of CLP (constraint logic programming) to several digital circuit design problems. It is shown that logic programming together with ef...
155
click to vote
CCL
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicat...