Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Ludics, Dialogue And Inferentialism, Alain Lecomte Dec 2013

Ludics, Dialogue And Inferentialism, Alain Lecomte

Baltic International Yearbook of Cognition, Logic and Communication

In this paper, we try to show that Ludics, a (pre-)logical framework invented by J-Y. Girard, enables us to rethink some of the relationships between Philosophy, Semantics and Pragmatics. In particular, Ludics helps to shed light on the nature of dialogue and to articulate features of Brandom's inferentialism.


Model Generation For Generalized Quantifiers Via Answer Set Programming, Yuliya Lierler, Günther Görz Nov 2013

Model Generation For Generalized Quantifiers Via Answer Set Programming, Yuliya Lierler, Günther Görz

Yuliya Lierler

For the semantic evaluation of natural language sentences, in particular those containing generalized quantifiers, we subscribe to the generate and test methodology to produce models of such sentences. These models are considered as means by which the sentences can be interpreted within a natural language processing system. The goal of this paper is to demonstrate that answer set programming is a simple, efficient and particularly well suited model generation technique for this purpose, leading to a straightforward implementation.


Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea Nov 2013

Computing Answer Sets Of A Logic Program Via-Enumeration Of Sat Certificates, Yuliya Lierler, Marco Maratea

Yuliya Lierler

Answer set programming is a new programming paradigm proposed based on the answer set semantics of Prolog. It is well known that an answer set for a logic program is also a model of the program's completion. The converse is true when the logic program is "tight". Lin and Zhao showed that for non-tight programs the models of completion which do not correspond to answer sets can be eliminated by adding to the completion what they called "loop formulas". Nevertheless, their solver ASSAT 1 has some disadvantages: it can work only with basic rules, and it can compute only one …


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

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

Yuliya Lierler

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.


Computing The Grounded Semantics In All The Subgraphs Of An Argumentation Framework: An Empirical Evaluation, Pierpaolo Dondio Sep 2013

Computing The Grounded Semantics In All The Subgraphs Of An Argumentation Framework: An Empirical Evaluation, Pierpaolo Dondio

Articles

Given an argumentation framework – with a finite set of arguments and the attack relation identifying the graph – we study how the grounded labelling of a generic argument a varies in all the subgraphs of . Since this is an intractable problem of above-polynomial complexity, we present two non-naïve algorithms to find the set of all the subgraphs where the grounded semantic assigns to argument a specific label . We report the results of a series of empirical tests over graphs of increasing complexity. The value of researching the above problem is two-fold. First, knowing how an argument behaves …


Usmmc: A Self-Contained Model Checker For Uml State Machines, Shuang Liu, Yang Liu, Jun Sun, Manchun Zheng, Bimlesh Wadhwa, Jin Song Dong Aug 2013

Usmmc: A Self-Contained Model Checker For Uml State Machines, Shuang Liu, Yang Liu, Jun Sun, Manchun Zheng, Bimlesh Wadhwa, Jin Song Dong

Research Collection School Of Computing and Information Systems

UML diagrams are gaining increasing usage in Object-Oriented system designs. UML state machines are specifically used in modeling dynamic behaviors of classes. It has been widely agreed that verification of system designs at an early stage will dramatically reduce the development cost. Tool support for verification UML designs can also encourage consistent usage of UML diagrams throughout the software development procedure. In this work, we present a tool, named USMMC, which turns model checking of UML state machines into practice. USMMC is a self-contained toolkit, which provides editing, interactive simulation as well as powerful model checking support for UML state …


A Support System For Graphics For Visually Impaired People, Hao Xu Jan 2013

A Support System For Graphics For Visually Impaired People, Hao Xu

Electronic Thesis and Dissertation Repository

As the Internet plays an important role in today’s society, graphics is widely used to present, convey and communicate information in many different areas. Complex information is often easier to understand and analyze by graphics. Even though graphics plays an important role, accessibility support is very limited for web graphics. Web graphics accessibility is not only for people with disabilities, but also for people who want to get and use information in ways different from the ones originally intended.

One of the problems regarding graphics for blind people is that we have few data on how a blind person draws …


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

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.


A Justification For Semantic Training In Data Curation Frameworks Development, Xiaogang Ma, Benjamin D. Branch, Kristin Wegner Jan 2013

A Justification For Semantic Training In Data Curation Frameworks Development, Xiaogang Ma, Benjamin D. Branch, Kristin Wegner

Libraries Faculty and Staff Presentations

In the complex data curation activities involving proper data access, data use optimization and data rescue, opportunities exist where underlying skills in semantics may play a crucial role in data curation professionals ranging from data scientists, to informaticists, to librarians. Here, We provide a conceptualization of semantics use in the education data curation framework (EDCF) (Fig. 1) [1] under development by Purdue University and endorsed by the GLOBE program [2] for further development and application. Our work shows that a comprehensive data science training includes both spatial and non-spatial data, where both categories are promoted by standard efforts of organizations …