Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Testing relativised uniform equivalence under answer-set projection in the system cc ⊤
Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria.ORCID iD: 0000-0002-9902-7662
Institut für Softwaretechnik, Technische Universität Wien, Vienna, Austria.
Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria.
Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria.
2009 (English)In: Applications of Declarative Programming and Knowledge Management: 17th International Conference, INAP 2007, and 21st Workshop on Logic Programming, WLP 2007, Würzburg, Germany, October 4-6, 2007, Revised Selected Papers, Springer, 2009, p. 241-246Conference paper, Published paper (Refereed)
Abstract [en]

The system cc ⊤ is a tool for testing correspondence between propositional logic programs under the answer-set semantics with respect to different refined notions of program correspondence. The underlying methodology of cc ⊤ is to reduce a given correspondence problem to the satisfiability problem of quantified propositional logic and to employ extant solvers for the latter language as back-end inference engines. In a previous version of cc ⊤, the system was designed to test correspondence between programs based on relativised strong equivalence under answer-set projection. Such a setting generalises the standard notion of strong equivalence by taking the alphabet of the context programs as well as the projection of the compared answer sets to a set of designated output atoms into account. This paper outlines a newly added component of cc ⊤ for testing similarly parameterised correspondence problems based on uniform equivalence.

Place, publisher, year, edition, pages
Springer, 2009. p. 241-246
Series
Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349 ; 5437
Keywords [en]
Answer set, Correspondence problems, Propositional logic, Satisfiability problems, Set semantics, Knowledge management, Logic programming
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hj:diva-63584DOI: 10.1007/978-3-642-00675-3_16Scopus ID: 2-s2.0-70350648900ISBN: 3642006744 (print)ISBN: 9783642006746 (print)OAI: oai:DiVA.org:hj-63584DiVA, id: diva2:1838090
Conference
17th International Conference, INAP 2007, and 21st Workshop on Logic Programming, WLP 2007, Würzburg, Germany, October 4-6, 2007
Available from: 2024-02-15 Created: 2024-02-15 Last updated: 2024-02-15Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Oetsch, Johannes

Search in DiVA

By author/editor
Oetsch, Johannes
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 6 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf