Skip to main content

Answer Set Programming and Other Computing Paradigms

Abstract Answer Set Programming (ASP) is one of the most prominent and successful knowledge representation paradigms. The success of ASP is due to its expressive non-monotonic modeling language and its efficient computational methods originating from building propositional satisfiability solvers. The wide adoption of ASP has motivated several extensions to its modeling language in order to enhance expressivity, such as incorporating aggregates and interfaces with ontologies. Also, in order to overcome the grounding bottleneck of computation in ASP, there are increasing interests in integrating ASP with other computing paradigms, such as Constraint Programming (CP) and Satisfiability Modulo Theories (SMT). Due to the non-monotonic nature of the ASP s... (more)
Created Date 2013
Contributor Meng, Yunsong (Author) / Lee, Joohyung (Advisor) / Ahn, Gail-Joon (Committee member) / Baral, Chitta (Committee member) / Fainekos, Georgios (Committee member) / Lifschitz, Vladimir (Committee member) / Arizona State University (Publisher)
Subject Computer science / Information technology / Answer Set Programming / Artificial Intelligence / Framework for Integration / Knowledge Representation and Reasoning / Logic Programming / Stable Model
Type Doctoral Dissertation
Extent 284 pages
Language English
Reuse Permissions All Rights Reserved
Note Ph.D. Computer Science 2013
Collaborating Institutions Graduate College / ASU Library
Additional Formats MODS / OAI Dublin Core / RIS

  Full Text
1.2 MB application/pdf
Download Count: 1165

Description Dissertation/Thesis