Information Extraction Tool Text2alm: From Narratives To Action Language System Descriptions, Craig Olson, Yuliya Lierler
Aug 2019
Information Extraction Tool Text2alm: From Narratives To Action Language System Descriptions, Craig Olson, Yuliya Lierler
Yuliya Lierler
In this work we design a narrative understanding tool Text2Alm. System Text2Alm uses an action language ALM to perform inferences on complex interactions of events described in narratives. The methodology used to implement the Text2Alm was originally outlined by Lierler et al. 2017 via a manual process of converting a narrative to an ALM model. It relies on a conglomeration of resources and techniques from two distinct fields of artificial intelligence, namely, natural language processing and knowledge representation and reasoning. The effectiveness of system Text2Alm is measured by its ability to correctly answer questions from the bAbI tasks published by …
Automatic Program Rewriting In Non-Ground Answer Set Programs, Yuliya Lierler
Jan 2019
Automatic Program Rewriting In Non-Ground Answer Set Programs, Yuliya Lierler
Yuliya Lierler
No abstract provided.
Automatic Program Rewriting In Non-Ground Answer Set Programs, Nicholas Hippen, Yuliya Lierler
Dec 2018
Automatic Program Rewriting In Non-Ground Answer Set Programs, Nicholas Hippen, Yuliya Lierler
Yuliya Lierler
Answer set programming is a popular constraint programming paradigm that has seen wide use across various industry applications. However, logic programs under answer set semantics often require careful design and nontrivial expertise from a programmer to obtain satisfactory solving times. In order to reduce this burden on a software engineer we propose an automated rewriting technique for non-ground logic programs that we implement in a system Projector. We conduct rigorous experimental analysis, which shows that applying system Projector to a logic program can improve its performance, even after significant human-performed optimizations.
Strong Equivalence And Program's Structure In Arguing Essential Equivalence Between First-Order Logic Programs, Yuliya Lierler
Dec 2018
Strong Equivalence And Program's Structure In Arguing Essential Equivalence Between First-Order Logic Programs, Yuliya Lierler
Yuliya Lierler
Answer set programming is a prominent declarative programming paradigm used in formulating combinatorial search problems and implementing distinct knowledge representation formalisms. It is common that several related and yet substantially different answer set programs exist for a given problem. Sometimes these encodings may display significantly different performance. Uncovering precise formal links between these programs is often important and yet far from trivial. This paper claims the correctness of a number of interesting program rewritings. Notably, they assume programs with variables and such important language features as choice, disjunction, and aggregates. We showcase the utility of some considered rewritings by using …