Sciweavers

CTRS
1990
13 years 8 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
CSFW
1998
IEEE
13 years 8 months ago
Data Level Inference Detection in Database Systems
Existing work on inference detection for database systems mainly employ functional dependencies in the database schema to detect inferences. It has been noticed that analyzing the...
Raymond W. Yip, Karl N. Levitt
IAT
2006
IEEE
13 years 10 months ago
Sixth-Sense: Context Reasoning for Potential Objects Detection in Smart Sensor Rich Environment
A new system named Sixth-Sense is proposed for obtaining physical world information in smart space. Our view is object-centered and sensors are attached to several objects in the ...
Bin Guo, Satoru Satake, Michita Imai
ACSC
2007
IEEE
13 years 10 months ago
On Inferences of Full Hierarchical Dependencies
Full hierarchical dependencies (FHDs) constitute a large class of relational dependencies. A relation exhibits an FHD precisely when it can be decomposed into at least two of its ...
Sven Hartmann, Sebastian Link
LICS
2008
IEEE
13 years 10 months ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
ICTAI
2008
IEEE
13 years 10 months ago
Information Extraction as an Ontology Population Task and Its Application to Genic Interactions
Ontologies are a well-motivated formal representation to model knowledge needed to extract and encode data from text. Yet, their tight integration with Information Extraction (IE)...
Alain-Pierre Manine, Érick Alphonse, Philip...
TABLEAUX
2009
Springer
13 years 10 months ago
Taming Displayed Tense Logics Using Nested Sequents with Deep Inference
We consider two sequent calculi for tense logic in which the syntactic judgements are nested sequents, i.e., a tree of traditional onesided sequents built from multisets of formula...
Rajeev Goré, Linda Postniece, Alwen Tiu
PPDP
2009
Springer
13 years 10 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano
SAS
2009
Springer
171views Formal Methods» more  SAS 2009»
14 years 4 months ago
Bottom-Up Shape Analysis
In this paper we present a new shape analysis algorithm. The key distinguishing aspect of our algorithm is that it is completely compositional, bottom-up and non-iterative. We pres...
Bhargav S. Gulavani, Supratik Chakraborty, Ganesan...