<div class="csl-bib-body">
<div class="csl-entry">Kiesl, B. (2014). <i>On transforming answer-set programs towards natural-language representations</i> [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2014.26928</div>
</div>
-
dc.identifier.uri
https://doi.org/10.34726/hss.2014.26928
-
dc.identifier.uri
http://hdl.handle.net/20.500.12708/3070
-
dc.description
Abweichender Titel laut Übersetzung der Verfasserin/des Verfassers
-
dc.description
Zsfassung in dt. Sprache
-
dc.description.abstract
Answer-set programming is a logic-programming formalism which has proven to be exceptionally well-suited for knowledge representation, reasoning, and solving complex search problems. Its fully declarative nature together with its simple and clear syntax allow for the formulation of compact problem specifications. While many answer-set programs may be relatively easy to understand for a programmer, their meaning may be rather hard to grasp for persons without a background in logic programming. Since many real world problems from various domains can be formulated within answer-set programming, it would be useful to translate answer-set programs into a form which is easier to understand and closer to natural language. In this thesis, we introduce some results which should help making such a translation possible. First, we analyse the structure of a given program: Most answer-set programs follow the so-called generate-define-test paradigm. Within this paradigm, a program is seen to consist of three different parts, called generate, define, and test. We introduce a formal definition of these three parts and develop an algorithm which classifies the rules of a given program accordingly. For the implementation of this algorithm, we make use of techniques from meta-programming, meaning that we write a logic program which operates on other logic programs. Following this, we also discuss how the rules of a program should be ordered before they are translated into some form of natural language. A straightforward translation of program rules into a form of natural language may yield rather clumsy results in general. One reason for this is that many real-world programs use more than one rule to define something which a human would explain within a single sentence. We thus introduce a generalisation of the well-known partial evaluation transformation which helps us to transform a given program into another program that is easier to translate. An important requirement for such a transformation is that it preserves equivalence, i.e., that it does not change the meaning of the original program. To this end, we use a notion of equivalence called relativised uniform equivalence which is stronger than ordinary equivalence but weaker than uniform equivalence. As a key result, we prove that our transformation preserves relativised uniform equivalence, which yields the straightforward corollary that it preserves ordinary equivalence over the answer-set semantics too.
en
dc.language
English
-
dc.language.iso
en
-
dc.rights.uri
http://rightsstatements.org/vocab/InC/1.0/
-
dc.subject
answer-set programming
en
dc.subject
natural-language representations
en
dc.subject
equivalence-preserving transformations
en
dc.title
On transforming answer-set programs towards natural-language representations
en
dc.title.alternative
On Transforming Answer-Set Programs Towards Natural-Language Representations
de
dc.type
Thesis
en
dc.type
Hochschulschrift
de
dc.rights.license
In Copyright
en
dc.rights.license
Urheberrechtsschutz
de
dc.identifier.doi
10.34726/hss.2014.26928
-
dc.contributor.affiliation
TU Wien, Österreich
-
dc.rights.holder
Benjamin Kiesl
-
tuw.version
vor
-
tuw.thesisinformation
Technische Universität Wien
-
tuw.publication.orgunit
E184 - Institut für Informationssysteme
-
dc.type.qualificationlevel
Diploma
-
dc.identifier.libraryid
AC12159747
-
dc.description.numberOfPages
94
-
dc.identifier.urn
urn:nbn:at:at-ubtuw:1-74754
-
dc.thesistype
Diplomarbeit
de
dc.thesistype
Diploma Thesis
en
tuw.author.orcid
0000-0003-3522-3653
-
dc.rights.identifier
In Copyright
en
dc.rights.identifier
Urheberrechtsschutz
de
tuw.advisor.staffStatus
staff
-
tuw.advisor.orcid
0000-0001-5673-2460
-
item.languageiso639-1
en
-
item.fulltext
with Fulltext
-
item.openaccessfulltext
Open Access
-
item.mimetype
application/pdf
-
item.openairetype
master thesis
-
item.grantfulltext
open
-
item.openairecristype
http://purl.org/coar/resource_type/c_bdcc
-
item.cerifentitytype
Publications
-
crisitem.author.dept
E192-04 - Forschungsbereich Formal Methods in Systems Engineering