Sciweavers

119 search results - page 4 / 24
» Completion Is an Instance of Abstract Canonical System Infer...
Sort
View
LICS
2003
IEEE
14 years 19 days ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
ER
2004
Springer
82views Database» more  ER 2004»
14 years 22 days ago
Reachability Problems in Entity-Relationship Schema Instances
Abstract. Recent developments in reification of ER schemata include automatic generation of webbased database administration systems [1,2]. These systems enforce the schema cardin...
Sebastiano Vigna
CSL
2004
Springer
14 years 23 days ago
Unsound Theorem Proving
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
Christopher Lynch
RTA
1993
Springer
13 years 11 months ago
Redundancy Criteria for Constrained Completion
This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present s...
Christopher Lynch, Wayne Snyder
ESWS
2007
Springer
13 years 9 months ago
SWHi System Description: A Case Study in Information Retrieval, Inference, and Visualization in the Semantic Web
Abstract. Search engines have become the most popular tools for finding information on the Internet. A real-world Semantic Web application can benefit from this by combining its ...
Ismail Fahmi, Junte Zhang, Henk Ellermann, Gosse B...