{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:06Z","timestamp":1725664746149},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609834"},{"type":"electronic","value":"9783540497516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60983-0_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:10:28Z","timestamp":1330272628000},"page":"103-117","source":"Crossref","is-referenced-by-count":7,"title":["Default negated conclusions: Why not?"],"prefix":"10.1007","author":[{"given":"Carlos Viegas","family":"Dam\u00e1sio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu\u00eds Moniz","family":"Pereira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF00883931","volume":"14","author":"J. J. Alferes","year":"1995","unstructured":"J. J. Alferes, C. V. Dam\u00e1sio, and L. M. Pereira. A logic programming system for non-monotonic reasoning. Journal of Automated Reasoning, 14(1):93\u2013147, 1995.","journal-title":"Journal of Automated Reasoning"},{"key":"7_CR2","first-page":"574","volume-title":"On logic program semantics with two kinds of negation","author":"J. J. Alferes","year":"1992","unstructured":"J. J. Alferes and L. M. Pereira. On logic program semantics with two kinds of negation. In K. Apt, editor, Joint International Conference and Symposium on Logic Programming, pages 574\u2013588, Washington, USA, November 1992. MIT Press."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"J. J. Alferes and L. M. Pereira. Belief, provability and logic programs. Journal of Applied Non-Classical Logics. Logics in AI. A selection of extended versions of JELIA '94 papers, 5(1), 1995.","DOI":"10.1080\/11663081.1995.10510842"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"J. J. Alferes and L. M. Pereira. Reasoning with Logic Programming. Springer-Verlag, 1996. In print.","DOI":"10.1007\/3-540-61488-5"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"J. J. Alferes, L. M. Pereira, and T. C. Przymusinski. Belief revision in non-monotonic reasoning. In C. Pinto-Ferreira and N. J. Mamede, editors, Proc. EPIA '95, LNAI 990, pages 41\u201356, 1995.","DOI":"10.1007\/3-540-60428-6_4"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"J. J. Alferes, L. M. Pereira, and T. C. Przymusinski. \u201cclassical\u201d negation in non-monotonic reasoning and logic programming. In AI & Math'96, 1996. To appear. Extended version available as technical report.","DOI":"10.1007\/3-540-61630-6_10"},{"issue":"3","key":"7_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","volume":"XXII","author":"J. Dix","year":"1995","unstructured":"J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: I. Strong Properties. Fundamenta Informaticae, XXII(3):227\u2013255, 1995.","journal-title":"Fundamenta Informaticae"},{"issue":"3","key":"7_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"XXII","author":"J. Dix","year":"1995","unstructured":"J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257\u2013288, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"7_CR9","unstructured":"J. Dix. Semantics of Logic Programs: Their Intuitions and Formal Properties. An Overview. In A. Fuhrmann and H. Rott, editors, Logic, Action and Information. Proceedings of the Konstanz Colloquium in Logic and Information (LogIn '92), pages 241\u2013329. DeGruyter, 1995."},{"issue":"23","key":"7_CR10","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","volume":"4","author":"M. V. Emden","year":"1976","unstructured":"M. V. Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733\u2013742, 1976.","journal-title":"Journal of ACM"},{"issue":"3","key":"7_CR11","first-page":"620","volume":"38","author":"A. V. Gelder","year":"1991","unstructured":"A. V. Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620\u2013650, 1991.","journal-title":"Journal of the ACM"},{"key":"7_CR12","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. A. Bowen, editors, ICLP'88, pages 1070\u20131080, 1988."},{"key":"7_CR13","unstructured":"M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, ICLP'90, pages 579\u2013597. MIT Press, 1990."},{"key":"7_CR14","doi-asserted-by":"crossref","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:365\u2013385, 1991.","journal-title":"New Generation Computing"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"K. Inoue and C. Sakama. On positive occurrences of negation as failure. In J. Doyle, E. Sandewall, and P. Torasso, editors, Proc. KR'94, pages 293\u2013304. Morgan-Kaufmann, 1994.","DOI":"10.1016\/B978-1-4832-1452-8.50123-8"},{"key":"7_CR16","unstructured":"C. Jonker. Constraints and Negations in Logic Programming. PhD thesis, Department of Philosophy-Utrecht University, September 1994."},{"key":"7_CR17","volume-title":"Technical report","author":"V. Lifschitz","year":"1992","unstructured":"V. Lifschitz. Minimal belief and negation as failure. Technical report, Department of Computer Science and Department of Philisophy, University of Texas at Austin, 1992."},{"key":"7_CR18","unstructured":"V. Lifschitz and T. C. Woo. Answer sets in general nonmonotonic reasoning (preliminary report). In B. Nebel, C. Rich, and W. Swartout, editors, Principles of Knowledge Representation and Reasoninng: Proceedinsg of the Third International Conference (KR'92), pages 603\u2013614. Morgan-Kaufmann, 1992."},{"key":"7_CR19","unstructured":"D. Pearce and G. Wagner. Reasoning with negative information I: Strong negation in logic programs. In L. Haaparanta, M. Kusch, and I. Niiniluoto, editors, Language, Knowledge and Intentionality, pages 430\u2013453. Acta Philosophica Fennica 49, 1990."},{"key":"7_CR20","first-page":"102","volume-title":"Well founded semantics for logic programs with explicit negation","author":"L. M. Pereira","year":"1992","unstructured":"L. M. Pereira and J. J. Alferes. Well founded semantics for logic programs with explicit negation. In B. Neumann, editor, European Conference on Artificial Intelligence, pages 102\u2013106, Wien, Austria, August 1992. John Wiley & Sons."},{"key":"7_CR21","unstructured":"T. Przymusinski. Extended stable semantics for normal and disjunctive programs. In Warren and Szeredi, editors, 7th International Conference on Logic Programming, pages 459\u2013477. MIT Press, 1990."},{"key":"7_CR22","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/BF01530826","volume":"14","author":"T. C. Przymusinski","year":"1995","unstructured":"T. C. Przymusinski. Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 14:323\u2013357, 1995.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H.-D. Gerhardt, editors, Mathematical Foundations of Database Systems, pages 357\u2013371. LNCS 495, Springer-Verlag, 1991.","DOI":"10.1007\/3-540-54009-1_25"},{"key":"7_CR24","unstructured":"G. Wagner. Vivid logic: Knowledge-based reasoning with two kinds of negation. Lecture Notes on Artificial Intelligence, 764, 1994."}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60983-0_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:28:41Z","timestamp":1619558921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60983-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609834","9783540497516"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60983-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}