Record link: 
http://hdl.handle.net/20.500.12708/57876
-
Title: 
Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs
-
Citation: 
Geibinger, T., & Tompits, H. (2019). Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. In F. Calimeri, N. Leone, & M. Manna (Eds.), Logics in Artificial Intelligence: 16th European Conference, JELIA 2019 (pp. 542–558). Springer. https://doi.org/10.1007/978-3-030-19570-0_36
-
Publisher DOI: 
10.1007/978-3-030-19570-0_36
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Authors: 
Geibinger, Tobias 
Tompits, Hans 
-
Organisational Unit: 
E192-03 - Forschungsbereich Knowledge Based Systems 
E192-02 - Forschungsbereich Databases and Artificial Intelligence 
-
Published in: 
Logics in Artificial Intelligence: 16th European Conference, JELIA 2019 
-
ISBN: 
978-3-030-19569-4
-
Volume: 
11468
-
DOI of the book: 
10.1007/978-3-030-19570-0
-
Date (published): 
2019
-
Event name: 
JELIA 2019 - 16th Edition of the European Conference on Logics in Artificial Intelligence 
-
Event date: 
7-May-2019 - 11-May-2019
-
Event place: 
Rende, Kalbrien, Italy
-
Number of Pages: 
17
-
Publisher: 
Springer, 11468
-
Publisher: 
Springer, Cham
-
Peer reviewed: 
Yes
-
Keywords: 
Answer-set programming · Program equivalence · Model-theoretic characterisations
-
Abstract: 
Starting with the seminal work on strong equivalence by Lifschitz, Pearce, and Valverde, many different advanced notions of program equivalence have been studied in the area of answer-set programming (ASP). In particular, relativised strong equivalence with projection has been introduced as a generalisation of strong equivalence by parameterising,on the one hand, the alphabet of the context programs used for checking program equivalence as well as, on the other hand, allowing the filtering of auxiliary atoms. Like many other advanced equivalence notions, it was introduced originally for propositional programs, along with model-theoretic concepts providing characterisations when equivalence between two programs hold. In this paper, we extend these concepts and characterisations to the general case of non-ground programs.
en
Project title: 
CD Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling (CDG Christian Doppler Forschungsgesellschaft) 
-
Research Areas: 
Logic and Computation: 100%
-
Science Branch: 
Informatik
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

189
checked on Nov 23, 2023

Google ScholarTM

Check