Let ML( u) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the definability of ML( u) in the spirit of the well-known Goldblatt-Thomason-Theorem. We show that an elementary class F of Kripke frames is definable in ML( u) if and only if F is closed under taking generated subframes and bounded morphic ...

Mining user requirements from application store reviews using frame semantics N. Jha and A. Mahmoud, Requirements Engineering: Foundation for Software Quality (REFSQ), accepted, 2017 Papers Research on mining user reviews in mobile application stores has noticeably advanced in the past few years. The majority of the proposed techniques rely on classifying the textual description of user reviews...

In this paper, we will propose a logic programming approach to design a frame-based language. The relationship among frame, logic and Prolog is our basic design issue. Frame is considered as a collection of slot-relations, and frame reference/inference procedure can be specified in logic form. Prolog is used to represent all of these concepts. Frame is encoded with Prolog facts and rules. This ...

Guarded logics have been shown to be amazingly versatile and tractable logics since their inception by Andréka, van Benthem, Németi in [1]. Features otherwise known from modal logics are lifted to the richer setting of general relational structures. The leading idea in this generalisation is the relativisation of quantifiers to tuples that are guarded by relational atoms. In a sense that can be...

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...

A novel argumentation semantics of defeasible logic programs (DeLP) is presented. Our goal is to build a semantics, which respects existing semantics and intuitions of “classical” logic programming. Generalized logic programs (GLP) are selected as an appropriate formalism for studying both undermining and rebutting. Our argumentation semantics is based on a notion of conflict resolution strateg...

Semantic parsing is the challenge of taking a sentence as input and generating a structured output, ideally a lexically and syntactically neutral representation of the semantics of the sentence. One common computational representation of semantics uses predicate logic; another makes use of predicate-argument structures defined with respect to some lexicon. The latter formulation of the problem ...

Abstract This paper introduces , a new semantic role labeling method that transforms text into frame-oriented knowledge graph. It performs dependency parsing, identifies the words evoke lexical frames, locates roles and fillers for each frame, runs coercion techniques, formalizes results as formal representation complies with frame semantics used in Framester, factual-linguistic linked data res...

A b s t r a c t. Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Thus, by defining a number of subminimal negations in the B+ context, principles of weak negation are shown to be isolable. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames...

The aim of this paper is to give characterizations of the notion of negative de nability as introduced in Venema This notion can be seen as an alternative way of de ning classes of Kripke frames via a modal language one that enables us for instance to de ne the previously unde nable class of irre exive frames Besides a list of closure conditions for negatively de nable classes the paper contain...