Sakthi Subramanian. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, University of Texas, Austin, Department of Computer Science, 1993. 153 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Mathematical Investigation of Reasoning About Actions - Kartha (1995) (7 citations) (Correct)
....for the automation of reasoning about action. For example, the logic programming interpreter XOLDT [Chen and Warren, 1992] is put to such use in [Lifschitz et al. 1993] the abductive procedure SLDNFA in [Denecker and De Schreye, 1993] and the theorem prover of [Boyer and Moore, 1988] in [Subramanian, 1993] . In [Thielscher, 1994a] the language A is related to the ideas of [Sandewall, 1992] In many ways, the expressive possibilities of A are limited. For instance, in A, all the fluents are assumed to be independent. Thus we cannot have, for instance, two fluent Alive and Dead, which are ....
Sakthi Subramanian. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, University of Texas, Austin, Department of Computer Science, 1993. 153
Causal Action Theories and Satisfiability Planning - Turner (1998) (Correct)
....In [BG93] the language AC is given a sound but incomplete translation into logic programming. In [Tur97] we specify a sound and complete translation into logic programming of a portion of the language AC. This translation is included in the first part of this dissertation. Subramanian [Sub93] embeds A in the logic of the Boyer Moore theorem prover [BM88] The languages AR 0 and AR are embedded in circumscriptive theories in [KL94, GKL95] Finally, in [Tur96a, Tur97] a portion of the language AC is embedded in default logic. Again, this translation is included in the first part of ....
Sakthi Subramanian. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, University of Texas, Austin, Department of Computer Science, 1993.
Reasoning about Actions with SLG - Lifschitz, McCain, Turner (1993) (Correct)
....that occur only in fluent expressions are found to terminate normally, too. Corresponding theoretical results about SLG resolution would be of interest. Denecker and De Schreye [1993] use their abductive logic programming system SLDNFA for the automation of reasoning problems expressed in A, and Subramanian [1993] shows how the Boyer Moore theorem prover [ Boyer and Moore, 1988 ] can be used for the same purpose. It would be interesting to compare the possiblities of these computational methods with the one proposed here. Acknowledgements We are grateful to Weidong Chen and David Warren for providing us ....
Sakthi Subramanian. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, University of Texas, Austin, Department of Computer Science, 1993.
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure - Uribe, al. (1994) (22 citations) (Correct)
....entries in any row or column. Whether such quasigroups existed for n 2 f9; 10; 12; 13; 14; 15g were all open problems that have now been solved (in the negative) by ldpp and Sato (the case n = 16 has been solved by a program of R. Hasegawa and by Sato, and n = 18 is the next open one) 6 Subramanian [1993] presents an interactive, mechanical verification of this theorem using Nqthm, the Boyer Moore prover. Two sets of extra constraints used to restrict the search in [ Fujita et al. 1993 ] and [ Slaney et al. 1993 ] were also of great help in finding solutions using obdds. The first reduces the ....
Sakthi Subramanian. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. Ph.D. Dissertation, Dept. of Comp. Science, U. of Texas, Austin, 1993.
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure - Uribe, Stickel (1994) (22 citations) (Correct)
....obdd strategy followed the variable ordering, consecutively adding all the constraints for each square. Most reasonable strategies yielded good performance; however, some that proved faster for n 12 could not be completed for n = 13 because of obdd exponential space requirements. 8 Subramanian [38] presents an interactive, mechanical verification of this theorem using Nqthm, the Boyer Moore prover. Table 2. Obdd and ldpp results for the Mutilated Checkerboard problem obdd obdd ldpp ldpp n time max size clauses branches time 4 0.07 66 68 2 0.00 5 0.21 245 119 36 0.01 6 0.39 608 184 137 ....
Subramanian, S. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, Dept. of Comp. Science, U. of Texas, Austin, 1993.
Actions with Indirect Effects - Kartha, Lifschitz (1994) (92 citations) (Correct)
....the automation of reasoning about action. For example, the logic programming interpreter XOLDT [ Chen and Warren, 1992 ] is put to such use in [ Lifschitz et al. 1993 ] the abductive procedure SLDNFA in [ Denecker and De Schreye, 1993 ] and the theorem prover of [ Boyer and Moore, 1988 ] in [ Subramanian, 1993 ] In [ Thielscher, 1993 ] the language A is related to the ideas of [ Sandewall, 1992 ] In spite of its extremely simple syntax, A provides a framework for discussing some interesting cases of reasoning about action, including temporal projection with incomplete information about the initial ....
Sakthi Subramanian. A Mechanized Framework for Specifying Problem Domains and Verifying Plans. PhD thesis, University of Texas, Austin, Department of Computer Science, 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC