4370 search results - page 672 / 874 » Algebra of Logic Programming |
165
click to vote
POPL
1993
ACM
15 years 8 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
111
click to vote
ICLP
1990
Springer
15 years 8 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
125
click to vote
FLOPS
2004
Springer
15 years 7 months ago
2004
Springer
This paper presents a self-applicable partial evaluator for a considerable subset of full Prolog. The partial evaluator is shown to achieve non-trivial specialisation and be effect...
161
click to vote
ESWS
2006
Springer
15 years 7 months ago
2006
Springer
Knowledge representation formalisms used on the Semantic Web adhere to a strict open world assumption. Therefore, nonmonotonic reasoning techniques are often viewed with scepticism...
161
click to vote
CODES
2008
IEEE
15 years 5 months ago
2008
IEEE
SystemC is widely used for modeling and simulation in hardware/software co-design. Due to the lack of a complete formal semantics, it is not possible to verify SystemC designs. In...