Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccinverted perpendicular

被引:0
|
作者
Oetsch, Johannes [1 ]
Seidl, Martina
Tompits, Hans [1 ]
Woltran, Stefan [1 ]
机构
[1] Vienna Univ Technol, Inst Informat Syst, Favoritenstr 9-11, A-1040 Vienna, Austria
基金
奥地利科学基金会;
关键词
SIMPLIFYING LOGIC PROGRAMS;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The system cc inverted perpendicular 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 inverted perpendicular 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 inverted perpendicular, 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 inverted perpendicular for testing similarly parameterised correspondence problems based on uniform equivalence.
引用
收藏
页码:241 / +
页数:2
相关论文
共 27 条
  • [1] Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs
    Geibinger, Tobias
    Tompits, Hans
    LOGICS IN ARTIFICIAL INTELLIGENCE, JELIA 2019, 2019, 11468 : 542 - 558
  • [2] Beyond Uniform Equivalence between Answer-set Programs
    Oetsch, Johannes
    Seidl, Martina
    Tompits, Hans
    Woltran, Stefan
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2021, 22 (01)
  • [3] ccinverted perpendicular on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions
    Oetsch, Johannes
    Seidl, Martina
    Tompits, Hans
    Woltran, Stefan
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, PROCEEDINGS, 2009, 5753 : 382 - +
  • [4] A common view on strong, uniform, and other notions of equivalence in answer-set programming
    Woltran, Stefan
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2008, 8 (217-234) : 217 - 234
  • [5] On Testing Answer-Set Programs
    Janhunen, Tomi
    Niemela, Ilkka
    Oetsch, Johannes
    Puhrer, Jorg
    Tompits, Hans
    ECAI 2010 - 19TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2010, 215 : 950 - 955
  • [6] Equivalence between answer-set programs under (partially) fixed input
    Bliem, Bernhard
    Woltran, Stefan
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2018, 83 (3-4) : 277 - 295
  • [7] Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
    Bliem, Bernhard
    Woltran, Stefan
    FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS (FOIKS 2016), 2016, 9616 : 95 - 111
  • [8] Equivalence between answer-set programs under (partially) fixed input
    Bernhard Bliem
    Stefan Woltran
    Annals of Mathematics and Artificial Intelligence, 2018, 83 : 277 - 295
  • [9] Alternative characterizations for program equivalence under answer-set semantics based on unfounded sets
    Gebser, Martin
    Schaub, Torsten
    Tornpits, Hans
    Woltran, Stefan
    FOUNDATIONS OF INFORMATION AND KNOWLEDGE SYSTEMS, PROCEEDINGS, 2008, 4932 : 24 - +
  • [10] Towards implementations for advanced equivalence checking in answer-set programming
    Tompits, H
    Woltran, S
    LOGIC PROGRAMMING, PROCEEDINGS, 2005, 3668 : 189 - 203