{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:18:27Z","timestamp":1725459507107},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630951"},{"type":"electronic","value":"9783540691297"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0035617","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:29:25Z","timestamp":1138184965000},"page":"122-130","source":"Crossref","is-referenced-by-count":3,"title":["Checking several forms of consistency in nonmonotonic knowledge-bases"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Mazure","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lakhdar","family":"Sa\u00efs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9ric","family":"Gr\u00e9goire","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journ. of the ACM 7 (1960) 201\u2013215","journal-title":"Journ. of the ACM"},{"unstructured":"Proc. of the Second DIMACS Challenge on Satisfiability Testing, Rutgers (1993)","key":"10_CR2"},{"unstructured":"Dubois, O., Andr\u00e9, P., Boufkhad, Y., Carlier, J.: SAT vs. UNSAT, in [2].","key":"10_CR3"},{"key":"10_CR4","first-page":"167","volume":"1","author":"R.E. Jeroslow","year":"1990","unstructured":"Jeroslow, R.E., Wang, J.: Solving Propositional Satisfiability Problems. Ann. Maths and AI 1 (1990) 167\u2013187","journal-title":"Ann. Maths and AI"},{"unstructured":"azure, B., Sa\u00efs, L., Gr\u00e9goire, E.: TWSAT: a New Local Search Algorithm for SAT. Performance and Analysis. CP'95 Workshop on Studying and Solving Really Hard Problems, Cassis, France (1995) 127\u2013130 (full version in Proc. AAAI-97)","key":"10_CR5"},{"unstructured":"azure, B., Sa\u00efs, L., Gr\u00e9goire, E.: Detecting logical inconsistencies. Proc. AI and Maths Symposium, Fort Lauderdale (FL) (1196) 116\u2013121","key":"10_CR6"},{"key":"10_CR7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription for formalizing common-sense knowledge. Artificial Intelligence 28 (1986) 89\u2013116","journal-title":"Artificial Intelligence"},{"unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and Easy Distributions of SAT Problems. Proc. AAAI-92 (1992) 459\u2013465","key":"10_CR8"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32 (1987) 57\u201395","journal-title":"Artificial Intelligence"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Reiter, R.: A logic for default reasoning. Artificial Intelligence 13 (1980) 81\u2013131","journal-title":"Artificial Intelligence"},{"unstructured":"Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. Proc. AAAI-92 (1992) 440\u2013446","key":"10_CR11"},{"unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local Search Strategies for Satisfiability Testing. Proc. DIMACS Workshop on Maximum Clique, Graph Coloring, and Satisfiability (1993)","key":"10_CR12"}],"container-title":["Lecture Notes in Computer Science","Qualitative and Quantitative Practical Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,8]],"date-time":"2019-02-08T21:49:53Z","timestamp":1549662593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035617"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630951","9783540691297"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0035617","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}