FLOPS
13 years 10 months ago
2004 Springer 
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
FLOPS
13 years 11 months ago
2004 Springer 
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
FLOPS
13 years 11 months ago
2004 Springer 
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
FLOPS
13 years 11 months ago
2004 Springer  FLOPS
13 years 10 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...
|
Automated Reasoning