{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:23:30Z","timestamp":1725485010740},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434726"},{"type":"electronic","value":"9783540460145"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46014-4_6","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T22:48:17Z","timestamp":1180565297000},"page":"54-64","source":"Crossref","is-referenced-by-count":1,"title":["Relating Defeasible Logic to Extended Logic Programs"],"prefix":"10.1007","author":[{"given":"George","family":"Antoniou","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"G. Antoniou, D. Billington and M.J. Maher. On the analysis of regulations using defeasible rules. In Proc. 32nd Hawaii International Conference on Systems Science, 1999.","key":"6_CR1","DOI":"10.1109\/HICSS.1999.772631"},{"issue":"1","key":"6_CR2","first-page":"45","volume":"41","author":"G. Antoniou","year":"2000","unstructured":"G. Antoniou, D. Billington and M. Maher. Defeasible Logic versus Logic Programming without Negation as Failure. Journal of Logic Programming 41,1 (2000): 45\u201357.","journal-title":"Journal of Logic Programming"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(99)00060-6","volume":"42","author":"G. Antoniou","year":"2000","unstructured":"G. Antoniou, M.J. Maher and D. Billington. Defeasible Logic versus Logic Programming without Negation as Failure, Journal of Logic Programming, 42 (2000): 47\u201357.","journal-title":"Journal of Logic Programming"},{"unstructured":"G. Antoniou, D. Billington, G. Governatori and M.J. Maher. A flexible framework for defeasible logics. In Proc. 17th American National Conference on Artificial Intelligence (AAAI-2000), 405\u2013410.","key":"6_CR4"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/371316.371517","volume":"2","author":"G. Antoniou","year":"2001","unstructured":"G. Antoniou, D. Billington, G. Governatori and M.J. Maher. Representation results for defeasible logic. ACM Transactions on Computational Logic 2 (2001): 255\u2013287","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1093\/logcom\/3.4.379","volume":"3","author":"D. Billington","year":"1993","unstructured":"D. Billington. Defeasible Logic is Stable. Journal of Logic and Computation 3 (1993): 370\u2013400.","journal-title":"Journal of Logic and Computation"},{"unstructured":"J.P. Delgrande, T Schaub and H. Tompits. Logic Programs with Compiled Preferences. In Proc. ECAI\u20192000, 464\u2013468.","key":"6_CR7"},{"unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. International Conference on Logic Programming, MIT Press 1988, 1070\u20131080.","key":"6_CR8"},{"key":"6_CR9","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 deductive databases. New Generation Computing 9 (1991): 365\u2013385.","journal-title":"New Generation Computing"},{"unstructured":"G. Governatori, A. ter Hofstede and P. Oaks. Defeasible Logic for Automated Negotiation. In Proc. Fifth CollECTeR Conference on Electronic Commerce, Brisbane 2000.","key":"6_CR10"},{"unstructured":"B.N. Grosof. Prioritized conflict handling for logic programs. In Proc. International Logic Programming Symposium, MIT Press 1997, 197\u2013211.","key":"6_CR11"},{"doi-asserted-by":"crossref","unstructured":"B.N. Grosof, Y. Labrou and H.Y. Chan. A Declarative Approach to Business Rules in Contracts: Courteous Logic Programs in XML. In Proc. 1st ACM Conference on Electronic Commerce (EC-99), ACM Press 1999.","key":"6_CR12","DOI":"10.1145\/336992.337010"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(91)90011-8","volume":"28","author":"H.A. Kautz","year":"1991","unstructured":"H.A. Kautz and B. Selman. Hard problems for simple default theories. Artificial Intelligence 28 (1991): 243\u2013279.","journal-title":"Artificial Intelligence"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/0743-1066(87)90007-0","volume":"4","author":"K. Kunen","year":"1987","unstructured":"K. Kunen. Negation in Logic Programming. Journal of Logic Programming 4 (1987): 289\u2013308.","journal-title":"Journal of Logic Programming"},{"doi-asserted-by":"crossref","unstructured":"M.J. Maher, A. Rock, G. Antoniou, D. Billington and T. Miller. Efficient Defeasible Reasoning Systems. In Proc. 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2000), IEEE 2000, 384\u2013392.","key":"6_CR15","DOI":"10.1109\/TAI.2000.889898"},{"doi-asserted-by":"crossref","unstructured":"M.J. Maher. A Denotational Semantics for Defeasible Logic. In Proc. First International Conference on Computational Logic, LNAI1861, Springer, 2000, 209\u2013222.","key":"6_CR16","DOI":"10.1007\/3-540-44957-4_14"},{"doi-asserted-by":"crossref","unstructured":"M.J. Maher. Propositional Defeasible Logic has Linear Complexity. Theory and Practice of Logic Programming, to appear.","key":"6_CR17","DOI":"10.1017\/S1471068401001168"},{"doi-asserted-by":"crossref","unstructured":"V. Marek and M. Truszczynski. Nonmonotonic Logic. Springer 1993.","key":"6_CR18","DOI":"10.1007\/978-3-662-02906-0"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(98)00073-3","volume":"103","author":"L. Morgenstern","year":"1998","unstructured":"L. Morgenstern. Inheritance Comes of Age: Applying Nonmonotonic Techniques to Problems in Industry. ArtiFIcial Intelligence, 103 (1998): 1\u201334.","journal-title":"ArtiFIcial Intelligence"},{"unstructured":"D. Nute. Defeasible Logic. In D.M. Gabbay, C.J. Hogger and J.A. Robinson (eds.): Handbook of Logic in Artificial Intelligence and Logic Programming Vol. 3, Oxford University Press 1994, 353\u2013395.","key":"6_CR20"},{"doi-asserted-by":"crossref","unstructured":"H. Prakken. Logical Tools for Modelling Legal Argument: A Study of Defeasible Reasoning in Law. Kluwer Academic Publishers 1997.","key":"6_CR21","DOI":"10.1007\/978-94-015-8975-8"},{"unstructured":"D.M. Reeves, B.N. Grosof, M.P. Wellman, and H.Y. Chan. Towards a Declarative Language for Negotiating Executable Contracts, Proceedings of the AAAI-99 Workshop on Artificial Intelligence in Electronic Commerce (AIEC-99), AAAI Press \/ MIT Press, 1999.","key":"6_CR22"},{"key":"6_CR23","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(1980): 81\u2013132.","journal-title":"Artificial Intelligence"},{"unstructured":"D.D. Touretzky, J.F. Horty and R.H. Thomason. A Clash of Intuitions: The Current State of Nonmonotonic Multiple Inheritance Systems. In Proc. IJCAI-87, Morgan Kaufmann 1987, 476\u2013482.","key":"6_CR24"}],"container-title":["Lecture Notes in Computer Science","Methods and Applications of Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46014-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:32:05Z","timestamp":1550349125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46014-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434726","9783540460145"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-46014-4_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}