Sciweavers

CONCUR
2012
Springer
12 years 1 months ago
MSO Decidability of Multi-Pushdown Systems via Split-Width
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
Aiswarya Cyriac, Paul Gastin, K. Narayan Kumar
EMNLP
2011
12 years 11 months ago
Identifying Relations for Open Information Extraction
Open Information Extraction (IE) is the task of extracting assertions from massive corpora without requiring a pre-specified vocabulary. This paper shows that the output of state...
Anthony Fader, Stephen Soderland, Oren Etzioni
ISCI
2002
106views more  ISCI 2002»
13 years 11 months ago
Neighborhood operator systems and approximations
This paper presents a framework for the study of generalizing the standard notion of equivalence relation in rough set approximation space with various categories of k-step neighb...
Wei-Zhi Wu, Wen-Xiu Zhang
MLQ
2000
88views more  MLQ 2000»
13 years 11 months ago
Logics of Complementarity in Information Systems
: Each information system (or data table) leads to a hierarchy of binary relations on the object set in a natural way; these relational systems can serve as frames for the semantic...
Ivo Düntsch, Ewa Orlowska
APAL
2007
119views more  APAL 2007»
13 years 11 months ago
An algebraic approach to subframe logics. Intuitionistic case
We develop duality between nuclei on Heyting algebras and certain binary relations on Heyting spaces. We show that these binary relations are in 1–1 correspondence with subframe...
Guram Bezhanishvili, Silvio Ghilardi
FOIS
2006
14 years 27 days ago
A Reusable Ontology for Fluents in OWL
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
Christopher A. Welty, Richard Fikes
MFCS
1995
Springer
14 years 3 months ago
Separations by Random Oracles and "Almost" Classes for Generalized Reducibilities
Let ≤r and ≤s be two binary relations on 2N which are meant as reducibilities. Let both relations be closed under finite variation (of their set arguments) and consider the un...
Wolfgang Merkle, Yongge Wang
LICS
1992
IEEE
14 years 3 months ago
Origins of the Calculus of Binary Relations
The calculus of binary relations was introduced by De Morgan in 1860, and was subsequently greatly developed by Peirce and Schr
Vaughan R. Pratt
MFCS
1993
Springer
14 years 3 months ago
The Second Calculus of Binary Relations
We view the Chu space interpretation of linear logic as an alternative interpretation of the language of the Peirce calculus of binary relations. Chu spaces amount to K-valued bin...
Vaughan R. Pratt
NLPRS
2001
Springer
14 years 4 months ago
Pruning UNL texts for Summarizing Purposes
This paper presents a summarization model based on the Universal Networking Language (UNL), which is a conceptual language for representing texts sentence by sentence, using seman...
Camilla Brandel Martins, Lucia Helena Machado Rino