Sciweavers

1960 search results - page 78 / 392
» The Logic of Large Enough
Sort
View
ICTAI
2008
IEEE
14 years 2 months ago
On Approaches to Explaining Infeasibility of Sets of Boolean Clauses
These last years, the issue of locating and explaining contradictions inside sets of propositional clauses has received a renewed attention due to the emergence of very efficient...
Éric Grégoire, Bertrand Mazure, C&ea...
DASFAA
2007
IEEE
141views Database» more  DASFAA 2007»
14 years 2 months ago
Integrating Similarity Retrieval and Skyline Exploration Via Relevance Feedback
Similarity retrieval have been widely used in many practical search applications. A similarity query model can be viewed as a logical combination of a set of similarity predicates....
Yiming Ma, Sharad Mehrotra
ASPDAC
2006
ACM
117views Hardware» more  ASPDAC 2006»
14 years 1 months ago
SAT-based optimal hypergraph partitioning with replication
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
Michael G. Wrighton, André DeHon
TCC
2005
Springer
118views Cryptology» more  TCC 2005»
14 years 1 months ago
On the Relationships Between Notions of Simulation-Based Security
Several compositional forms of simulation-based security have been proposed in the literature, including universal composability, black-box simulatability, and variants thereof. Th...
Anupam Datta, Ralf Küsters, John C. Mitchell,...
APLAS
2004
ACM
14 years 1 months ago
A Relational Model for Object-Oriented Designs
This paper develops a mathematical characterisation of object-oriented concepts by defining an observation-oriented semantics for an object-oriented language (OOL) with a rich var...
Jifeng He, Zhiming Liu, Xiaoshan Li, Shengchao Qin