Query processing in quantitative logic programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 310 LNCS, Issue , 1988, Pages 81-100

  Subrahmanian, V S ^a  

^a SYRACUSE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC PROGRAMMING; SEMANTICS; THEOREM PROVING;

AND-OR TREE; COMPLETENESS THEOREMS; DECLARATIVE SEMANTICS; LOGIC PROGRAMS; OPERATIONAL SEMANTICS; SOUNDNESS AND COMPLETENESS; WELL-COVERED;

COMPUTER CIRCUITS;

EID: 84981430335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0012824     Document Type: Conference Paper

References (14)

1. Apt, K., Blair, H., Walker, A. “Towards a Theory of Declarative Knowledge”, to appear, 1988.
2. Blair, H.A., Brown, A.L., Subrahmanian, V.S. “A Logic Programming Semantics Scheme, Part I”, Logic Programming Research Group Tech. Report LPRG-TR-88-8, Syracuse University.
3. Blair, H.A., Subrahmanian, V.S. “Paraconsistent Logic Programming”, Proc. 7th Intl. Conf. on Foundations of Software Tech. & Theoretical Computer Science, Lecture Notes in Computer Science Vol. 287, pps 340–360, Springer Verlag, Dec. 1987.
4. Blair, H.A., Subrahmanian, V.S. “Foundations of Generally Horn Logic Programming”, in preparation.
5. da Costa, N.C.A. “On the Theory of Inconsistent Formal Systems”, Notre Dame J. of Formal Logic, 15, pps 497–510, 1974.
6. da Costa, N.C.A. “A Semantical Analysis of the Calculi C n”, Notre Dame J. of Formal Logic, 18, pps 621–630, 1977.
7. da Costa, N.C.A., Alves, E.H. “Relations between Paraconsistent Logic and Many Valued Logic”, Bull. of the Section of Logic, 10, pps 185–191, 1981.
8. Fitting, M. “A Kripke-Kleene semantics for logic programs”, J. of Logic Programming, 2, 4, pps 295–312, 1985.
9. Fitting, M. “Notes on the Mathematical Aspects of Kripke's Theory of Truth”, Notre Dame J. of Formal Logic, 27, 1, pps 75–88, 1986.
10. Lloyd, J.W. “Foundations of Logic Programming”, Springer.
11. Lassez, J.-L., Maher, M. “Optimal Fixed-points of Logic Programs”, Theoret. Comput. Sci., 39, pps 115–125, 1985.
12. Subrahmanian, V.S. “On the Semantics of Quantitative Logic Programs”, Proc. 4th IEEE Symp. on Logic Prog., pps 173–182, San Francisco, Sep. 1987.
13. Subrahmanian, V.S. “Towards a Theory of Evidential Reasoning in Logic Programming”, Logic Colloquium '87, Granada, Spain, July 1987.
14. Van Emden, M.H. “Quantitative Deduction and its Fixpoint Theory”, J. of Logic Prog., 4, 1, pps 37–53, 1986.