Skip to main content

Bridging the Gap between Classical Logic Based Formalisms and Logic Programs

Abstract Different logic-based knowledge representation formalisms have different limitations either with respect to expressivity or with respect to computational efficiency. First-order logic, which is the basis of Description Logics (DLs), is not suitable for defeasible reasoning due to its monotonic nature. The nonmonotonic formalisms that extend first-order logic, such as circumscription and default logic, are expressive but lack efficient implementations. The nonmonotonic formalisms that are based on the declarative logic programming approach, such as Answer Set Programming (ASP), have efficient implementations but are not expressive enough for representing and reasoning with open domains. This dissertation uses the first-order stable model sem... (more)
Created Date 2012
Contributor Palla, Ravi Kiran Reddy (Author) / Lee, Joohyung (Advisor) / Baral, Chitta (Committee member) / Kambhampati, Subbarao (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)
Subject Computer science / Artificial Intelligence / Knowledge Representation and Reasoning / Logic Programming / Nonmonotonic Reasoning / Reasoning about Actions / Rules and Ontologies
Type Doctoral Dissertation
Extent 231 pages
Language English
Reuse Permissions All Rights Reserved
Note Ph.D. Computer Science 2012
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS

  Full Text
779.5 KB application/pdf
Download Count: 261

Description Dissertation/Thesis