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 |
Cite this
}
POLYNOMIAL-TIME PROPOSITIONAL LOGIC. / Crossley, John N.; Scott, Philip J.
1988. 237-245.Research output: Contribution to conference › Paper › Other › peer-review
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
SP - 237
EP - 245
ER -