1986•Journal of Automated ReasoningRequires access

Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions

C. Aquilano, Roberto Barbuti, P. Bocchetti, Maurizio Martelli

Open publisher page 12 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Negation as failure, Completeness (order theory), Horn clause, Negation, Programming language, Computer science, French horn, Process (computing)

Back to paper search Browse research topics Original source

Negation as Failure. Completeness of the Query Evaluation Process for horn clause programs with recursive definitions — Research Paper | ScholarLens