Thumbnail
Access Restriction
Subscribed

Author Dantsin, Evgeny ♦ Eiter, Thomas ♦ Gottlob, Georg ♦ Voronkov, Andrei
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2001
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Complexity ♦ Datalog ♦ Expressive power ♦ Logic programming ♦ Nonmonotonic logic ♦ Query languages
Abstract This article surveys various complexity and expressiveness results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming.
ISSN 03600300
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2001-09-01
Publisher Place New York
e-ISSN 15577341
Journal ACM Computing Surveys (CSUR)
Volume Number 33
Issue Number 3
Page Count 52
Starting Page 374
Ending Page 425


Open content in new tab

   Open content in new tab
Source: ACM Digital Library