POLYNOMIAL-TIME PROPOSITIONAL LOGIC.

John N. Crossley; Philip J. Scott

POLYNOMIAL-TIME PROPOSITIONAL LOGIC.

Research output: Contribution to conference › Paper

Abstract

We propose an extension to conventional propositional logic which has applications to the interaction of PROLOG and other logic programming languages with databases. We plan to use the special characteristics of databases together with the extremely general problem-solving abilities of PROLOG, so that the PROLOG compiler/interpreter does not have to reproduce (at significant cost in time and memory) what is quickly accessible in the database.

Original language	English
Pages	237-245
Number of pages	9
Publication status	Published - 1 Jan 1988
Externally published	Yes

Access to Document

Link to publication in Scopus

Cite this

Crossley, J. N., & Scott, P. J. (1988). POLYNOMIAL-TIME PROPOSITIONAL LOGIC.. 237-245.

@conference{2c76d20b9ab34328a45db05afe9985f3,

title = "POLYNOMIAL-TIME PROPOSITIONAL LOGIC.",

abstract = "We propose an extension to conventional propositional logic which has applications to the interaction of PROLOG and other logic programming languages with databases. We plan to use the special characteristics of databases together with the extremely general problem-solving abilities of PROLOG, so that the PROLOG compiler/interpreter does not have to reproduce (at significant cost in time and memory) what is quickly accessible in the database.",

author = "Crossley, {John N.} and Scott, {Philip J.}",

year = "1988",

month = jan,

day = "1",

language = "English",

pages = "237--245",

}

TY - CONF

T1 - POLYNOMIAL-TIME PROPOSITIONAL LOGIC.

AU - Crossley, John N.

AU - Scott, Philip J.

PY - 1988/1/1

Y1 - 1988/1/1

N2 - We propose an extension to conventional propositional logic which has applications to the interaction of PROLOG and other logic programming languages with databases. We plan to use the special characteristics of databases together with the extremely general problem-solving abilities of PROLOG, so that the PROLOG compiler/interpreter does not have to reproduce (at significant cost in time and memory) what is quickly accessible in the database.

AB - We propose an extension to conventional propositional logic which has applications to the interaction of PROLOG and other logic programming languages with databases. We plan to use the special characteristics of databases together with the extremely general problem-solving abilities of PROLOG, so that the PROLOG compiler/interpreter does not have to reproduce (at significant cost in time and memory) what is quickly accessible in the database.

UR - http://www.scopus.com/inward/record.url?scp=0023830470&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0023830470

SP - 237

EP - 245

ER -