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 firstname.lastname@example.org.
- 3 Public
- 2 Artificial Intelligence
- 2 Computer science
- 1 Answer Set Programming
- 1 Artificial intelligence
- 1 Cognitive models
- 1 Computer Science
- 1 Computer engineering
- 1 Cyber security
- 1 Defeasible logic programming
- 1 Framework for Integration
- 1 Information technology
- 1 Knowledge Representation and Reasoning
- 1 Logic Programming
- 1 Machine Learning
- 1 Stable Model
- 1 answer set programming
- 1 asp
- 1 causal logic
- 1 ccalc
- 1 cplus2asp
- 1 knowledge representation
- 1 threat intelligence
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 …
- Meng, Yunsong, Lee, Joohyung, Ahn, Gail-Joon, et al.
- Created Date
Reasoning about the activities of cyber threat actors is critical to defend against cyber attacks. However, this task is difficult for a variety of reasons. In simple terms, it is difficult to determine who the attacker is, what the desired goals are of the attacker, and how they will carry out their attacks. These three questions essentially entail understanding the attacker’s use of deception, the capabilities available, and the intent of launching the attack. These three issues are highly inter-related. If an adversary can hide their intent, they can better deceive a defender. If an adversary’s capabilities are not well …
- Nunes, Eric, Shakarian, Paulo, Ahn, Gail-Joon, et al.
- Created Date
Action language C+ is a formalism for describing properties of actions, which is based on nonmonotonic causal logic. The definite fragment of C+ is implemented in the Causal Calculator (CCalc), which is based on the reduction of nonmonotonic causal logic to propositional logic. This thesis describes the language of CCalc in terms of answer set programming (ASP), based on the translation of nonmonotonic causal logic to formulas under the stable model semantics. I designed a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input …
- Casolary, Michael, Lee, Joohyung, Ahn, Gail-Joon, et al.
- Created Date