{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:09:31Z","timestamp":1761620971482},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417682"},{"type":"electronic","value":"9783540452416"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45241-9_12","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:24:00Z","timestamp":1188311040000},"page":"169-183","source":"Crossref","is-referenced-by-count":91,"title":["An A-Prolog Decision Support System for the Space Shuttle"],"prefix":"10.1007","author":[{"given":"Monica","family":"Nogueira","sequence":"first","affiliation":[]},{"given":"Marcello","family":"Balduccini","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Gelfond","sequence":"additional","affiliation":[]},{"given":"Richard","family":"Watson","sequence":"additional","affiliation":[]},{"given":"Matthew","family":"Barry","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1018985923441","volume":"22","author":"F. Bacchus","year":"1998","unstructured":"F. Bacchus and F. Kabanza. Planning for Temporally Extended Goals. Annals of Mathematics and Artificial Intelligence, 22:1\u20132, 5-27, 1998.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"12_CR2","unstructured":"M. Balduccini, M. Gelfond and M. Nogueira. A-Prolog as a tool for declarative programming. In Proceedings of the 12th International Conference on Software Engineering and Knowledge Engineering (SEKE\u20192000), 63\u201372, 2000."},{"key":"12_CR3","unstructured":"M. Balduccini, M. Gelfond and M. Nogueira. Digital Circuits in A-Prolog. Technical Report, University of Texas at El Paso, 2000."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"M. Barry and R. Watson. Reasoning about actions for spacecraft redundancy management. In Proceedings of the 1999 IEEE Aerospace Conference, 5:101\u2013112, 1999.","DOI":"10.1109\/AERO.1999.790194"},{"key":"12_CR5","unstructured":"P. Cholewinski, W. Marek and M. Truszczy\u0144ski. Default Reasoning System DeReS. In International Conference on Principles of Knowledge Representation and Reasoning, 518\u2013528. Morgan Kauffman, 1996."},{"key":"12_CR6","unstructured":"S. Citrigno, T. Eiter, W. Faber, G. Gottlob, C. Koch, N. Leone, C. Mateis, G. Pfeifer and F. Scarcello. The dlv system: Model generator and application frontends. In Proceedings of the 12th Workshop on Logic Programming, 128\u2013137, 1997."},{"key":"12_CR7","unstructured":"G. De Micheli. Synthesis and Optimization of Digital Circuits. McGraw-Hill Series in Electrical and Computer Engineering, 1994."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in nonmonotonic logic programs. Lecture Notes in Artificial Intelligence-Recent Advances in AI Planning, Proceedings of the 4th European Conference on Planning, ECP\u201997, 1348:169\u2013181, 1997.","DOI":"10.1007\/3-540-63912-8_84"},{"key":"12_CR9","unstructured":"E. Erdem and V. Lifschitz. Transitive Closure, Answer Sets and Predicate Completion. Submitted for publication, 2000."},{"key":"12_CR10","unstructured":"A. Finzi, F. Pirri and R. Reiter. Open World Planning in the Situation Calculus. 17th National Conference of Artificial Intelligence (AAAI\u201900), 754\u2013760, 2000."},{"key":"12_CR11","unstructured":"M. Gelfond and A. Gabaldon. From Functional Specifications to Logic Programs. In Proceedings of the International Logic Programming Symposium (ILPS\u201997), 1997."},{"key":"12_CR12","unstructured":"M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programs. In Proceedings of the 5th International Conference on Logic Programming, 1070\u20131080, 1988."},{"issue":"3\/4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"M. Gelfond and V. Lifschitz. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 9(3\/4):365\u2013386, 1991.","journal-title":"New Generation Computing"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0743-1066(93)90035-F","volume":"17","author":"M. Gelfond","year":"1993","unstructured":"M. Gelfond and V. Lifschitz. Representing Actions and Change by Logic Programs. Journal of Logic Programming, 17:301\u2013323, 1993.","journal-title":"Journal of Logic Programming"},{"key":"12_CR15","unstructured":"M. Gelfond and V. Lifschitz. Action languages. Electronic Transactions on AI, 3(16), 1998."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"M. Gelfond, and R. Watson. On methodology for representing knowledge in dynamic domains. In Proceedings of the 1998 ARO\/ONR\/NSF\/DARPA Monterey Workshop on Engineering Automation for Computer Based Systems, 57\u201366, 1999.","DOI":"10.1016\/S1571-0661(04)00137-9"},{"key":"12_CR17","unstructured":"Y. Huang, H. Kautz and B. Selman. Control Knowledge in Planning: Benefits and Tradeoffs. 16th National Conference of Artificial Intelligence (AAAI\u201999), 511\u2013517, 1999."},{"key":"12_CR18","unstructured":"H. Kautz and B. Selman. The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. In Proceedings of AIPS\u201998, 1998."},{"key":"12_CR19","unstructured":"Z. Kohavi. Switching and Finite Automata Theory. McGraw-Hill CS Series, 1978."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"V. Lifschitz. Action languages, Answer Sets, and Planning. In The Logic Programming Paradigm: a 25-Year Perspective, 357\u2013373. Spring-Verlag, 1999.","DOI":"10.1007\/978-3-642-60085-2_16"},{"key":"12_CR21","unstructured":"N. McCain and H. Turner. A causal theory of ramifications and qualifications. In Proceedings of IJCAI\u201995, 1978\u20131984, 1995."},{"key":"12_CR22","unstructured":"N. McCain and H. Turner. Causal theories of action and change. In 14th National Conference of Artificial Intelligence (AAAI\u201997), 460\u2013465, 1997."},{"issue":"1","key":"12_CR23","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","volume":"25","author":"R. Moore","year":"1985","unstructured":"R. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(1):75\u201394, 1985.","journal-title":"Artificial Intelligence"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4, and P. Simons. Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In Proceedings of the 4th International Conference on Logic Programming and Non-Monotonic Reasoning, 420\u2013429, 1997.","DOI":"10.1007\/3-540-63255-7_32"},{"issue":"12","key":"12_CR25","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1,2):81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"issue":"1\u20133","key":"12_CR26","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0743-1066(96)00125-2","volume":"31","author":"H. Turner","year":"1997","unstructured":"H. Turner. Representing actions in logic programs and default theories: A situation calculus approach. Journal of Logic Programming, Vol. 31, No. 1\u20133, 245\u2013298, 1997.","journal-title":"Journal of Logic Programming"},{"key":"12_CR27","series-title":"Lect Notes Comput Sci","first-page":"290","volume-title":"An application of action theory to the space shuttle","author":"R. Watson","year":"1999","unstructured":"R. Watson. An application of action theory to the space shuttle. Lecture Notes in Computer Science-Procs of Practical Aspects of Declarative Languages\u2019 99, 1551:290\u2013304, 1999."}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45241-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:08:23Z","timestamp":1556816903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45241-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417682","9783540452416"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-45241-9_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}