{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:18:36Z","timestamp":1725484716381},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424642"},{"type":"electronic","value":"9783540446521"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44652-4_45","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:39:07Z","timestamp":1180672747000},"page":"510-521","source":"Crossref","is-referenced-by-count":8,"title":["On Computing Solutions to Belief Change Scenarios"],"prefix":"10.1007","author":[{"given":"James P.","family":"Delgrande","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.2307\/2274239","volume":"50","author":"C. Alchourr\u00f3n","year":"1985","unstructured":"C. Alchourr\u00f3n, P. Gardenfors, and D. Makinson. On the Logic of Theory Change: Partial Meet Contraction and Revision Functions. Journal of Symbolic Logic, 50:510\u2013530, 1985.","journal-title":"Journal of Symbolic Logic"},{"key":"45_CR2","unstructured":"M. Cadoli, A. Giovanardi, and M. Schaerf. An Algorithm to Evaluate Quantified Boolean Formulae. In Proc. AAAI-98, pages 262\u2013267, 1998."},{"key":"45_CR3","unstructured":"J. Delgrande and T. Schaub. A Consistency-Based Model for Belief Change: Preliminary Report. In Proc. AAAI-00, pages 392\u2013398, 2000."},{"key":"45_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-84222-0","volume-title":"Relative Complexities of First Order Calculi","author":"E. Eder","year":"1992","unstructured":"E. Eder. Relative Complexities of First Order Calculi. Vieweg Verlag, Braunschweig, 1992."},{"key":"45_CR5","unstructured":"U. Egly, T. Eiter, R. Feldmann, V. Klotz, S..Schamberger, H. Tompits, and S. Woltran. On Mechanizing Modal Nonmonotonic Logics. In Proc. DGNMR-01, pages 44\u201353, 2001."},{"key":"45_CR6","unstructured":"U. Egly, T. Eiter, V. Klotz, H. Tompits, and S. Woltran. Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. In Proc. AAAISpring Symposium-01, pages 53\u201359, 2001."},{"key":"45_CR7","unstructured":"U. Egly, T. Eiter, H. Tompits, and S. Woltran. Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In Proc. AAAI-00, pages 417\u2013422, 2000."},{"key":"45_CR8","unstructured":"R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulas. In Proc. AAAI-00, pages 285\u2013290, 2000."},{"key":"45_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01066356","volume":"3","author":"A. Fuhrmann","year":"1994","unstructured":"A. Fuhrmann and S. Hansson. A Survey of Multiple Contraction. Journal of Logic, Language, and Information, 3:39\u201374, 1994.","journal-title":"Journal of Logic, Language, and Information"},{"key":"45_CR10","volume-title":"Knowledge in Flux: Modeling the Dynamics of Epistemic States","author":"P. G\u00e4rdenfors","year":"1988","unstructured":"P. G\u00e4rdenfors. Knowledge in Flux: Modeling the Dynamics of Epistemic States. The MIT Press, Cambridge, MA, 1988."},{"key":"45_CR11","unstructured":"H. Kautz and B. Selman. Planning as Satisfiability. In Proc. ECAI-92, pages 359\u2013363, 1992."},{"issue":"1","key":"45_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H. Kleine-B\u00fcning","year":"1995","unstructured":"H. Kleine-B\u00fcning, M. Karpinski, and A. Fl\u00f6gel. Resolution for Quantified Boolean Formulas. Information and Computation, 117(1):12\u201318, 1995.","journal-title":"Information and Computation"},{"key":"45_CR13","doi-asserted-by":"crossref","unstructured":"B. Nebel. Syntax Based Approaches to Belief Revision. In P. Gardenfors, editor, Belief Revision, pages 52\u201388. Cambridge University Press, 1992.","DOI":"10.1017\/CBO9780511526664.003"},{"issue":"3","key":"45_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D. A. Plaisted","year":"1986","unstructured":"D. A. Plaisted and S. Greenbaum. A Structure Preserving Clause Form Translation. Journal of Symbolic Computation, 2(3):293\u2013304, 1986.","journal-title":"Journal of Symbolic Computation"},{"key":"45_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1613\/jair.591","volume":"10","author":"J. Rintanen","year":"1999","unstructured":"J. Rintanen. Constructing Conditional Plans by a Theorem Proven Journal of Artificial Intelligence Research, 10:323\u2013352, 1999.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"45_CR16","unstructured":"J. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. IJCAI-99, pages 1192\u20131197, 1999."},{"issue":"1","key":"45_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. J. Stockmeyer","year":"1976","unstructured":"L. J. Stockmeyer. The Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1): 1\u201322, 1976.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"45_CR18","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C. Wrathall","year":"1976","unstructured":"C. Wrathall. Complete Sets and the Polynomial-Time Hierarchy. Theoretical Computer Science, 3(1):23\u201333, 1976.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Symbolic and Quantitative Approaches to Reasoning with Uncertainty"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44652-4_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:04:35Z","timestamp":1550369075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44652-4_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424642","9783540446521"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44652-4_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}