ASU Electronic Theses and Dissertations
This collection includes most of the ASU Theses and Dissertations from 2011 to present. ASU Theses and Dissertations are available in downloadable PDF format; however, a small percentage of items are under embargo. Information about the dissertations/theses includes degree information, committee members, an abstract, supporting data or media.
In addition to the electronic theses found in the ASU Digital Repository, ASU Theses and Dissertations can be found in the ASU Library Catalog.
Dissertations and Theses granted by Arizona State University are archived and made available through a joint effort of the ASU Graduate College and the ASU Libraries. For more information or questions about this collection contact or visit the Digital Repository ETD Library Guide or contact the ASU Graduate College at gradformat@asu.edu.
- Bartholomew, Michael James
- Bazzi, Rida
- Fainekos, Georgios
- 1 Arizona State University
- 1 Colbourn, Charles
- 1 Lee, Joohyung
- 1 Lifschitz, Vladimir
- 1 English
- 1 Public
- Artificial intelligence
- answer set programming
- 1 defeasible
- 1 knowledge representation
- 1 nonmonotonic
- 1 reasoning
- 1 satisfiability modulo theories
- Dwarf Galaxies as Laboratories of Protogalaxy Physics: Canonical Star Formation Laws at Low Metallicity
- Evolutionary Genetics of CORL Proteins
- Social Skills and Executive Functioning in Children with PCDH-19
- Deep Domain Fusion for Adaptive Image Classification
- Software Defined Pulse-Doppler Radar for Over-The-Air Applications: The Joint Radar-Communications Experiment
Knowledge representation and reasoning is a prominent subject of study within the field of artificial intelligence that is concerned with the symbolic representation of knowledge in such a way to facilitate automated reasoning about this knowledge. Often in real-world domains, it is necessary to perform defeasible reasoning when representing default behaviors of systems. Answer Set Programming is a widely-used knowledge representation framework that is well-suited for such reasoning tasks and has been successfully applied to practical domains due to efficient computation through grounding--a process that replaces variables with variable-free terms--and propositional solvers similar to SAT solvers. However, some domains provide …
- Contributors
- Bartholomew, Michael James, Lee, Joohyung, Bazzi, Rida, et al.
- Created Date
- 2016