Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for +publisher:"University of Texas – Austin" +contributor:("Lifschitz, Vladimir"). Showing records 1 – 17 of 17 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Beltagy, Islam Kamel Ahmed. Natural language semantics using probabilistic logic.

Degree: PhD, Computer science, 2016, University of Texas – Austin

 With better natural language semantic representations, computers can do more applications more efficiently as a result of better understanding of natural text. However, no single… (more)

Subjects/Keywords: NLP; Machine learning; Probabilistic logic; MLNs; PSL; Markov Logic Network; QA; RTE; STS

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Beltagy, I. K. A. (2016). Natural language semantics using probabilistic logic. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/46617

Chicago Manual of Style (16th Edition):

Beltagy, Islam Kamel Ahmed. “Natural language semantics using probabilistic logic.” 2016. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/46617.

MLA Handbook (7th Edition):

Beltagy, Islam Kamel Ahmed. “Natural language semantics using probabilistic logic.” 2016. Web. 24 Jan 2021.

Vancouver:

Beltagy IKA. Natural language semantics using probabilistic logic. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2016. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/46617.

Council of Science Editors:

Beltagy IKA. Natural language semantics using probabilistic logic. [Doctoral Dissertation]. University of Texas – Austin; 2016. Available from: http://hdl.handle.net/2152/46617


University of Texas – Austin

2. -0657-6898. Link formation in mobile and economic networks : model and empirical analysis.

Degree: PhD, Computer Science, 2015, University of Texas – Austin

 In this dissertation, we study three link formation problems in mobile and economic networks: (i) company matching for mergers and acquisitions (M&A) network in the… (more)

Subjects/Keywords: Link formation; Mobile ecosystem; Economic networks; Topic model; Econometric model; Big Data; M&A; Cross promotion; Social network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-0657-6898. (2015). Link formation in mobile and economic networks : model and empirical analysis. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/46762

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-0657-6898. “Link formation in mobile and economic networks : model and empirical analysis.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/46762.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-0657-6898. “Link formation in mobile and economic networks : model and empirical analysis.” 2015. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-0657-6898. Link formation in mobile and economic networks : model and empirical analysis. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/46762.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-0657-6898. Link formation in mobile and economic networks : model and empirical analysis. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/46762

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

3. -9723-9557. A hierarchical approach to formal modeling and verification of asynchronous circuits.

Degree: PhD, Computer Science, 2019, University of Texas – Austin

 The self-timed (or asynchronous) approach to circuit design has demonstrated benefits in a number of different areas for its low energy consumption, high operating speed,… (more)

Subjects/Keywords: Asynchronous circuit; Formal verification; Hierarchical verification; Non-deterministic behavior; Functional correctness; Link-joint model; Mechanical theorem proving; ACL2; Hardware description language

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-9723-9557. (2019). A hierarchical approach to formal modeling and verification of asynchronous circuits. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://dx.doi.org/10.26153/tsw/2194

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-9723-9557. “A hierarchical approach to formal modeling and verification of asynchronous circuits.” 2019. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://dx.doi.org/10.26153/tsw/2194.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-9723-9557. “A hierarchical approach to formal modeling and verification of asynchronous circuits.” 2019. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-9723-9557. A hierarchical approach to formal modeling and verification of asynchronous circuits. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2019. [cited 2021 Jan 24]. Available from: http://dx.doi.org/10.26153/tsw/2194.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-9723-9557. A hierarchical approach to formal modeling and verification of asynchronous circuits. [Doctoral Dissertation]. University of Texas – Austin; 2019. Available from: http://dx.doi.org/10.26153/tsw/2194

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

4. Erdoğan, Selim Turhan, 1977-. A library of general-purpose action descriptions.

Degree: PhD, Computer Sciences, 2008, University of Texas – Austin

 An important idea in knowledge representation is that of libraries of reusable knowledge components. The goal of this research is to apply this idea to… (more)

Subjects/Keywords: Modular Action Description (Computer program language); C++ (Computer program language)

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Erdoğan, Selim Turhan, 1. (2008). A library of general-purpose action descriptions. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/17848

Chicago Manual of Style (16th Edition):

Erdoğan, Selim Turhan, 1977-. “A library of general-purpose action descriptions.” 2008. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/17848.

MLA Handbook (7th Edition):

Erdoğan, Selim Turhan, 1977-. “A library of general-purpose action descriptions.” 2008. Web. 24 Jan 2021.

Vancouver:

Erdoğan, Selim Turhan 1. A library of general-purpose action descriptions. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2008. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/17848.

Council of Science Editors:

Erdoğan, Selim Turhan 1. A library of general-purpose action descriptions. [Doctoral Dissertation]. University of Texas – Austin; 2008. Available from: http://hdl.handle.net/2152/17848

5. Yang, Fangkai. Representing actions in logic-based languages.

Degree: PhD, Computer Science, 2014, University of Texas – Austin

 Knowledge about actions is an important part of commonsense knowledge studied in Artificial Intelligence. For decades, researchers have been developing methods for describing how actions… (more)

Subjects/Keywords: Representing actions; Dynamic domain; Causal theories; Logic programming; Stable model semantics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, F. (2014). Representing actions in logic-based languages. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/24883

Chicago Manual of Style (16th Edition):

Yang, Fangkai. “Representing actions in logic-based languages.” 2014. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/24883.

MLA Handbook (7th Edition):

Yang, Fangkai. “Representing actions in logic-based languages.” 2014. Web. 24 Jan 2021.

Vancouver:

Yang F. Representing actions in logic-based languages. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2014. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/24883.

Council of Science Editors:

Yang F. Representing actions in logic-based languages. [Doctoral Dissertation]. University of Texas – Austin; 2014. Available from: http://hdl.handle.net/2152/24883

6. Erdem, Esra. Theory and applications of answer set programming.

Degree: PhD, Computer Sciences, 2002, University of Texas – Austin

Subjects/Keywords: Declarative programming; Programming languages (Electronic computers) – Semantics

Page 1 Page 2 Page 3 Page 4 Page 5

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Erdem, E. (2002). Theory and applications of answer set programming. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/561

Chicago Manual of Style (16th Edition):

Erdem, Esra. “Theory and applications of answer set programming.” 2002. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/561.

MLA Handbook (7th Edition):

Erdem, Esra. “Theory and applications of answer set programming.” 2002. Web. 24 Jan 2021.

Vancouver:

Erdem E. Theory and applications of answer set programming. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2002. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/561.

Council of Science Editors:

Erdem E. Theory and applications of answer set programming. [Doctoral Dissertation]. University of Texas – Austin; 2002. Available from: http://hdl.handle.net/2152/561


University of Texas – Austin

7. Lee, Joohyung. Automated reasoning about actions.

Degree: PhD, Computer Sciences, 2005, University of Texas – Austin

 The study of reasoning about a tions is an important subarea of the theory of ommonsense reasoning. It is on erned with developing appropriate systems… (more)

Subjects/Keywords: Automatic theorem proving; Logic programming languages; Nonmonotonic reasoning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lee, J. (2005). Automated reasoning about actions. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/1782

Chicago Manual of Style (16th Edition):

Lee, Joohyung. “Automated reasoning about actions.” 2005. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/1782.

MLA Handbook (7th Edition):

Lee, Joohyung. “Automated reasoning about actions.” 2005. Web. 24 Jan 2021.

Vancouver:

Lee J. Automated reasoning about actions. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2005. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/1782.

Council of Science Editors:

Lee J. Automated reasoning about actions. [Doctoral Dissertation]. University of Texas – Austin; 2005. Available from: http://hdl.handle.net/2152/1782


University of Texas – Austin

8. Ferraris, Paolo, 1972-. Expressiveness of answer set languages.

Degree: PhD, Computer Sciences, 2007, University of Texas – Austin

 Answer set programming (ASP) is a form of declarative programming oriented towards difficult combinatorial search problems. It has been applied, for instance, to plan generation… (more)

Subjects/Keywords: Programming languages (Electronic computers) – Syntax; Programming languages (Electronic computers) – Semantics; Declarative programming; Logic programming languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ferraris, Paolo, 1. (2007). Expressiveness of answer set languages. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/3210

Chicago Manual of Style (16th Edition):

Ferraris, Paolo, 1972-. “Expressiveness of answer set languages.” 2007. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/3210.

MLA Handbook (7th Edition):

Ferraris, Paolo, 1972-. “Expressiveness of answer set languages.” 2007. Web. 24 Jan 2021.

Vancouver:

Ferraris, Paolo 1. Expressiveness of answer set languages. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2007. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/3210.

Council of Science Editors:

Ferraris, Paolo 1. Expressiveness of answer set languages. [Doctoral Dissertation]. University of Texas – Austin; 2007. Available from: http://hdl.handle.net/2152/3210

9. Han, David Ching-Wey. Action selection and coordination of autonomous agents for UAV surveillance.

Degree: PhD, Electrical and Computer Engineering, 2011, University of Texas – Austin

 Agents, by definition, (1) are situated in an environment upon which their actions affect changes and (2) have some level of autonomy from the control… (more)

Subjects/Keywords: Autonomous agents; Action selection; Commitment; UAV

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Han, D. C. (2011). Action selection and coordination of autonomous agents for UAV surveillance. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-12-4486

Chicago Manual of Style (16th Edition):

Han, David Ching-Wey. “Action selection and coordination of autonomous agents for UAV surveillance.” 2011. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2011-12-4486.

MLA Handbook (7th Edition):

Han, David Ching-Wey. “Action selection and coordination of autonomous agents for UAV surveillance.” 2011. Web. 24 Jan 2021.

Vancouver:

Han DC. Action selection and coordination of autonomous agents for UAV surveillance. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2011. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-12-4486.

Council of Science Editors:

Han DC. Action selection and coordination of autonomous agents for UAV surveillance. [Doctoral Dissertation]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-12-4486

10. Davis, Jared Curran. A self-verifying theorem prover.

Degree: PhD, Computer Sciences, 2009, University of Texas – Austin

 Programs have precise semantics, so we can use mathematical proof to establish their properties. These proofs are often too large to validate with the usual… (more)

Subjects/Keywords: Milawa; mathematical logic; formal verification; Lisp; proof checking; theorem proving; automated reasoning; reflection; soundness; fidelity; faithfulness; rewriting; proof building; tactics; first-order logic; verified verifier

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Davis, J. C. (2009). A self-verifying theorem prover. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2009-12-435

Chicago Manual of Style (16th Edition):

Davis, Jared Curran. “A self-verifying theorem prover.” 2009. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2009-12-435.

MLA Handbook (7th Edition):

Davis, Jared Curran. “A self-verifying theorem prover.” 2009. Web. 24 Jan 2021.

Vancouver:

Davis JC. A self-verifying theorem prover. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2009. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2009-12-435.

Council of Science Editors:

Davis JC. A self-verifying theorem prover. [Doctoral Dissertation]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/ETD-UT-2009-12-435

11. Harrison, Amelia J. Formal methods for answer set programming.

Degree: PhD, Computer Science, 2018, University of Texas – Austin

 Answer set programming (ASP) is a declarative programming paradigm for the design and implementation of knowledge-intensive applications, particularly useful for modeling problems involving combinatorial search.… (more)

Subjects/Keywords: Logic programming; Formal methods

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7 Sample image

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Harrison, A. J. (2018). Formal methods for answer set programming. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/63692

Chicago Manual of Style (16th Edition):

Harrison, Amelia J. “Formal methods for answer set programming.” 2018. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/63692.

MLA Handbook (7th Edition):

Harrison, Amelia J. “Formal methods for answer set programming.” 2018. Web. 24 Jan 2021.

Vancouver:

Harrison AJ. Formal methods for answer set programming. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2018. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/63692.

Council of Science Editors:

Harrison AJ. Formal methods for answer set programming. [Doctoral Dissertation]. University of Texas – Austin; 2018. Available from: http://hdl.handle.net/2152/63692

12. Kim, Doo Soon. Knowledge integration in machine reading.

Degree: PhD, Computer Science, 2011, University of Texas – Austin

 Machine reading is the artificial-intelligence task of automatically reading a corpus of texts and, from the contents, building a knowledge base that supports automated reasoning… (more)

Subjects/Keywords: Machine reading; Knowledge integration; Artificial intelligence; Text understanding; NLP

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, D. S. (2011). Knowledge integration in machine reading. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2011-08-4049

Chicago Manual of Style (16th Edition):

Kim, Doo Soon. “Knowledge integration in machine reading.” 2011. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2011-08-4049.

MLA Handbook (7th Edition):

Kim, Doo Soon. “Knowledge integration in machine reading.” 2011. Web. 24 Jan 2021.

Vancouver:

Kim DS. Knowledge integration in machine reading. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2011. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2011-08-4049.

Council of Science Editors:

Kim DS. Knowledge integration in machine reading. [Doctoral Dissertation]. University of Texas – Austin; 2011. Available from: http://hdl.handle.net/2152/ETD-UT-2011-08-4049

13. -6174-923X. Efficient, mechanically-verified validation of satisfiability solvers.

Degree: PhD, Computer Sciences, 2015, University of Texas – Austin

 Satisfiability (SAT) solvers are commonly used for a variety of applications, including hardware verification, software verification, theorem proving, debugging, and hard combinatorial problems. These applications… (more)

Subjects/Keywords: Formal verification; Theorem proving; Satisfiability; Formal methods; Proofs; Proofs of unsatisfiability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

-6174-923X. (2015). Efficient, mechanically-verified validation of satisfiability solvers. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/30538

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

-6174-923X. “Efficient, mechanically-verified validation of satisfiability solvers.” 2015. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/30538.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

-6174-923X. “Efficient, mechanically-verified validation of satisfiability solvers.” 2015. Web. 24 Jan 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

-6174-923X. Efficient, mechanically-verified validation of satisfiability solvers. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2015. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/30538.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

-6174-923X. Efficient, mechanically-verified validation of satisfiability solvers. [Doctoral Dissertation]. University of Texas – Austin; 2015. Available from: http://hdl.handle.net/2152/30538

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Texas – Austin

14. Ren, Wanwan. A modular language for describing actions.

Degree: PhD, Computer Sciences, 2009, University of Texas – Austin

 This dissertation is about the design of a modular language for describing actions. The modular action description language, MAD, is based on the action language… (more)

Subjects/Keywords: Artificial intelligence; Knowledge representation; Reasoning about actions; Action languages; Modularity; Causal logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ren, W. (2009). A modular language for describing actions. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2009-12-473

Chicago Manual of Style (16th Edition):

Ren, Wanwan. “A modular language for describing actions.” 2009. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2009-12-473.

MLA Handbook (7th Edition):

Ren, Wanwan. “A modular language for describing actions.” 2009. Web. 24 Jan 2021.

Vancouver:

Ren W. A modular language for describing actions. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2009. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2009-12-473.

Council of Science Editors:

Ren W. A modular language for describing actions. [Doctoral Dissertation]. University of Texas – Austin; 2009. Available from: http://hdl.handle.net/2152/ETD-UT-2009-12-473


University of Texas – Austin

15. Lierler, Yuliya. SAT-based answer set programming.

Degree: PhD, Computer Sciences, 2010, University of Texas – Austin

 Answer set programming (ASP) is a declarative programming paradigm oriented towards difficult combinatorial search problems. Syntactically, ASP programs look like Prolog programs, but solutions are… (more)

Subjects/Keywords: Answer set programming; Logic programming; Propositional satisfiability; Answer set solvers; SAT; SAT solvers; Smodels; Cmodels

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lierler, Y. (2010). SAT-based answer set programming. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-888

Chicago Manual of Style (16th Edition):

Lierler, Yuliya. “SAT-based answer set programming.” 2010. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2010-05-888.

MLA Handbook (7th Edition):

Lierler, Yuliya. “SAT-based answer set programming.” 2010. Web. 24 Jan 2021.

Vancouver:

Lierler Y. SAT-based answer set programming. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2010. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-888.

Council of Science Editors:

Lierler Y. SAT-based answer set programming. [Doctoral Dissertation]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-888


University of Texas – Austin

16. Kuhlmann, Gregory John. Automated domain analysis and transfer learning in general game playing.

Degree: PhD, Computer Sciences, 2010, University of Texas – Austin

 Creating programs that can play games such as chess, checkers, and backgammon, at a high level has long been a challenge and benchmark for AI.… (more)

Subjects/Keywords: Games; Machine learning; Knowledge transfer; Reinforcement learning; General game playing; Computer games; Artificial Intelligence; AI

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kuhlmann, G. J. (2010). Automated domain analysis and transfer learning in general game playing. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-08-1975

Chicago Manual of Style (16th Edition):

Kuhlmann, Gregory John. “Automated domain analysis and transfer learning in general game playing.” 2010. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2010-08-1975.

MLA Handbook (7th Edition):

Kuhlmann, Gregory John. “Automated domain analysis and transfer learning in general game playing.” 2010. Web. 24 Jan 2021.

Vancouver:

Kuhlmann GJ. Automated domain analysis and transfer learning in general game playing. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2010. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1975.

Council of Science Editors:

Kuhlmann GJ. Automated domain analysis and transfer learning in general game playing. [Doctoral Dissertation]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-08-1975


University of Texas – Austin

17. Shao, Danhua. Application of local semantic analysis in fault prediction and detection.

Degree: PhD, Electrical and Computer Engineering, 2010, University of Texas – Austin

 To improve quality of software systems, change-based fault prediction and scope-bounded checking have been used to predict or detect faults during software development. In fault… (more)

Subjects/Keywords: Version management; Semantic analysis; Data-flow analysis; Control-flow analysis; Scope-bounded checking; Alloy; First-order logic; SAT; Computation graph; White-box testing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shao, D. (2010). Application of local semantic analysis in fault prediction and detection. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/ETD-UT-2010-05-1086

Chicago Manual of Style (16th Edition):

Shao, Danhua. “Application of local semantic analysis in fault prediction and detection.” 2010. Doctoral Dissertation, University of Texas – Austin. Accessed January 24, 2021. http://hdl.handle.net/2152/ETD-UT-2010-05-1086.

MLA Handbook (7th Edition):

Shao, Danhua. “Application of local semantic analysis in fault prediction and detection.” 2010. Web. 24 Jan 2021.

Vancouver:

Shao D. Application of local semantic analysis in fault prediction and detection. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2010. [cited 2021 Jan 24]. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1086.

Council of Science Editors:

Shao D. Application of local semantic analysis in fault prediction and detection. [Doctoral Dissertation]. University of Texas – Austin; 2010. Available from: http://hdl.handle.net/2152/ETD-UT-2010-05-1086

.