`Travelled to:`

1 × Australia

1 × France

6 × USA

`Collaborated with:`

B.T.Smith ∅ G.Nadathur R.E.Shostak C.R.Reddy D.W.Reed

`Talks about:`

program (3) prolog (3) interpret (2) disjunct (2) altern (2) logic (2) near (2) horn (2) implement (1) character (1)

## Person: Donald W. Loveland

### DBLP: Loveland:Donald_W=

### Facilitated 1 volumes:

### Contributed to:

### Wrote 8 papers:

- LICS-1995-NadathurL #logic programming #proving
- Uniform Proofs and Disjunctive Logic Programming (GN, DWL), pp. 148–155.
- ISLP-1991-ReedLS #logic programming #source code
- An Alternative Characterization of Disjunctive Logic Programs (DWR, DWL, BTS), pp. 54–68.
- CADE-1988-SmithL #implementation #prolog
- An nH-Prolog Implementation (BTS, DWL), pp. 766–767.
- JICSCP-1988-SmithL88 #interpreter #prolog
- A Simple Near-Horn Prolog Interpreter (BTS, DWL), pp. 794–809.
- ICLP-1987-Loveland87 #prolog
- Near-Horn PROLOG (DWL), pp. 456–469.
- CADE-1980-LovelandS
- Simplifying Interpreted Formulas (DWL, RES), pp. 97–109.
- STOC-1978-ReddyL #bound #quantifier
- Presburger Arithmetic with Bounded Quantifier Alternation (CRR, DWL), pp. 320–325.
- STOC-1969-Loveland #complexity #metric #on the
- On Minimal-Program Complexity Measures (DWL), pp. 61–65.