Physical Sciences and Mathematics Commons^™

A Critique Of “Gamification” In Khan Academy, Betsy Disalvo, Briana B. Morrison

Computer Science Faculty Proceedings & Presentations

Khan Academy (Kahn Acadamy, 2013) is an informal online learning platform that is adding game elements that participants encounter as they move through curricula. This “gamification”, includes the addition of badges, accomplishment statistics and skill tree visualizations that reflect the completion of different learning task and participation in the online community. In this paper we outline the types of gamification used in Khan academy and reflect on their effectiveness in relation to learning theory and motivation theory.

Research Challenges And Opportunities In Knowledge Representation, Section 2.4.2 Advances In Satisfiability And Answer Set Programming, Natasha Noy, Deborah Mcguinness, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Final report edited by Natasha Noy and Deborah McGuinness.

Report Section 2.4.2, Advances in satisfiability and answer set programming, authored by Yuliya Lierer, UNO faculty member.

Research Challenges And Opportunities In Knowledge Representation, Section 4.1.1 Hybrid Kr, Natasha Noy, Deborah Mcguinness, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Final report edited by Natasha Noy and Deborah McGuinness.

Report Section 4.1.1 Hybrid KR, co-authored by Yuliya Lierer, UNO faculty member.

Research Challenges And Opportunities In Knowledge Representation, Section 2.3.2: Applications Based On Formal Models, Natasha Noy, Deborah Mcguinness, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Final report edited by Natasha Noy and Deborah McGuinness.

Report Section 2.3.2, Applications based on formal models, authored by Yuliya Lierer, UNO faculty member.

Modular Answer Set Solving, Yuliya Lierler, Miroslaw Truszczyński

Computer Science Faculty Proceedings & Presentations

Modularity is essential for modeling large-scale practical applications.We propose modular logic programs as a modular version of answer set programming and study the relationship of our formalism to an earlier concept of lp-modules.

Logic Programs Vs. First-Order Formulas In Textual Inference, Yuliya Lierler, Vladimir Lifschitz

Computer Science Faculty Proceedings & Presentations

In the problem of recognizing textual entailment, the goal is to decide, given a text and a hypothesis expressed in a natural language, whether a human reasoner would call the hypothesis a consequence of the text. One approach to this problem is to use a first-order reasoning tool to check whether the hypothesis can be derived from the text conjoined with relevant background knowledge, after expressing all of them by first-order formulas. Another possibility is to express the hypothesis, the text, and the background knowledge in a logic programming language, and use a logic programming system. We discuss the relation …

Towards A Tight Integration Of Syntactic Parsing With Semantic Disambiguation By Means Of Declarative Programming, Yuliya Lierler, Peter Schüller

Computer Science Faculty Proceedings & Presentations

We propose and advocate the use of an advanced declarative programming paradigm – answer set programming – as a uniform platform for integrated approach towards syntax-semantic processing in natural language. We illustrate that (a) the parsing technology based on answer set programming implementation reaches performance sufficient for being a useful NLP tool, and (b) the proposed method for incorporating semantic information from FRAMENET into syntactic parsing may prove to be useful in allowing semantic-based disambiguation of syntactic structures.

Prolog And Asp Inference Under One Roof, Marcello Balduccini, Yuliya Lierler, Peter Schüller

Computer Science Faculty Proceedings & Presentations

Answer set programming (ASP) is a declarative programming paradigm stemming from logic programming that has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. The proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from PROLOG. Using PROLOG inference on non-ground portions of a given program, both grounding time and the size of the ground …

Abstract Modular Systems And Solvers, Yuliya Lierler, Miroslaw Truszczyński

Computer Science Faculty Proceedings & Presentations

Integrating diverse formalisms into modular knowledge representation systems offers increased expressivity, modeling convenience and computational benefits. We introduce concepts of abstract modules and abstract modular systems to study general principles behind the design and analysis of modelfinding programs, or solvers, for integrated heterogeneous multi-logic systems. We show how abstract modules and abstract modular systems give rise to transition systems, which are a natural and convenient representation of solvers pioneered by the SAT community. We illustrate our approach by showing how it applies to answer set programming and propositional logic, and to multi-logic systems based on these two formalisms.

Hybrid Automated Reasoning Tools: From Black-Box To Clear-Box Integration, Marcello Balduccini, Yuliya Lierler

Computer Science Faculty Proceedings & Presentations

Recently, researchers in answer set programming and constraint programming spent significant efforts in the development of hybrid languages and solving algorithms combining the strengths of these traditionally separate fields. These efforts resulted in a new research area: constraint answer set programming (CASP). CASP languages and systems proved to be largely successful at providing efficient solutions to problems involving hybrid reasoning tasks, such as scheduling problems with elements of planning. Yet, the development of CASP systems is difficult, requiring non-trivial expertise in multiple areas. This suggests a need for a study identifying general development principles of hybrid systems. Once these principles …