Gentzen-type refutation systems for three-valued logics with an application to disproving strong equivalence
2011 (English)In: Logic Programming and Nonmonotonic Reasoning: 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011, Proceedings / [ed] J. P. Delgrande & W. Faber, Springer, 2011, p. 254-259Conference paper, Published paper (Refereed)
Abstract [en]
While the purpose of conventional proof calculi is to axiomatise the set of valid sentences of a logic, refutation systems axiomatise the invalid sentences. Such systems are relevant not only for proof-theoretic reasons but also for realising deductive systems for nonmonotonic logics. We introduce Gentzen-type refutation systems for two basic three-valued logics and we discuss an application of one of these calculi for disproving strong equivalence between answer-set programs.
Place, publisher, year, edition, pages
Springer, 2011. p. 254-259
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 6645
Keywords [en]
Deductive systems, Nonmonotonic logic, Three-valued logic, Answer set, Biomineralization, Logic programming, Pathology, Application programs, Computer circuits, Computer systems programming, Many valued logics
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hj:diva-63576DOI: 10.1007/978-3-642-20895-9_28Scopus ID: 2-s2.0-79955779345ISBN: 9783642208942 (print)OAI: oai:DiVA.org:hj-63576DiVA, id: diva2:1838384
Conference
11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011
2024-02-162024-02-162024-02-16Bibliographically approved