On the Computational Power of the Logic Programs

Ivan N. Soskov
Additional contact information
Ivan N. Soskov: Laboratory for Applied Logic at Sofia University

A chapter in Mathematical Logic, 1990, pp 117-137 from Springer

Abstract: Abstract The aim of the present paper is a comparative study of the computational power of the logic programs and search computability [1].

Keywords: Logic Program; Partial Structure; Enumeration Operator; Predicate Symbol; Search Computability (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0609-2_10

Ordering information: This item can be ordered from
http://www.springer.com/9781461306092

DOI: 10.1007/978-1-4613-0609-2_10

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().