Sciweavers

552 search results - page 83 / 111
» On the Complexity of Join Predicates
Sort
View
CSL
2010
Springer
13 years 8 months ago
On the Computability of Region-Based Euclidean Logics
By a Euclidean logic, we understand a formal language whose variables range over subsets of Euclidean space, of some fixed dimension, and whose non-logical primitives have fixed me...
Yavor Nenov, Ian Pratt-Hartmann
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Refinement Types for Logical Frameworks and Their Interpretation as Proof Irrelevance
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
William Lovas, Frank Pfenning
CORR
2007
Springer
177views Education» more  CORR 2007»
13 years 7 months ago
N3Logic: A Logical Framework For the World Wide Web
The Semantic Web drives towards the use of the Web for interacting with logically interconnected data. Through knowledge models such as Resource Description Framework (RDF), the S...
Tim Berners-Lee, Dan Connolly, Lalana Kagal, Yosi ...
JAR
2006
103views more  JAR 2006»
13 years 7 months ago
A Framework for Verifying Bit-Level Pipelined Machines Based on Automated Deduction and Decision Procedures
We describe an approach to verifying bit-level pipelined machine models using a combination of deductive reasoning and decision procedures. While theorem proving systems such as AC...
Panagiotis Manolios, Sudarshan K. Srinivasan
CORR
2002
Springer
132views Education» more  CORR 2002»
13 years 7 months ago
Nonmonotonic Reasoning, Preferential Models and Cumulative Logics
Many systems that exhibit nonmonotonic behavior have been described and studied already in the literature. The general notion of nonmonotonic reasoning, though, has almost always ...
Sarit Kraus, Daniel J. Lehmann, Menachem Magidor