Results 1  10
of
478,391
A Complete Resolution Calculus for Signed MaxSAT
, 2007
"... We define a resolutionstyle rule for solving the MaxSAT problem of Signed CNF formulas (Signed MaxSAT) and prove that our rule provides a complete calculus for that problem. From the completeness proof we derive an original exact algorithm for solving Signed MaxSAT. Finally, we present some conn ..."
Abstract
 Add to MetaCart
We define a resolutionstyle rule for solving the MaxSAT problem of Signed CNF formulas (Signed MaxSAT) and prove that our rule provides a complete calculus for that problem. From the completeness proof we derive an original exact algorithm for solving Signed MaxSAT. Finally, we present some
A complete calculus for MaxSAT
 IN SAT2006
, 2006
"... MaxSAT is the problem of finding an assignment minimizing the number of unsatisfied clauses of a given CNF formula. We propose a resolutionlike calculus for MaxSAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completenes ..."
Abstract

Cited by 15 (10 self)
 Add to MetaCart
MaxSAT is the problem of finding an assignment minimizing the number of unsatisfied clauses of a given CNF formula. We propose a resolutionlike calculus for MaxSAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From
Resolution for MaxSAT
, 2007
"... MaxSAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolutionlike calculus for MaxSAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
MaxSAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolutionlike calculus for MaxSAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof
A calculus for cryptographic protocols: The spi calculus
 Information and Computation
, 1999
"... We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols; the ..."
Abstract

Cited by 919 (55 self)
 Add to MetaCart
We introduce the spi calculus, an extension of the pi calculus designed for the description and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for studying authentication protocols. The pi calculus (without extension) suffices for some abstract protocols
The lexical nature of syntactic ambiguity resolution
 Psychological Review
, 1994
"... Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive fr ..."
Abstract

Cited by 556 (23 self)
 Add to MetaCart
Ambiguity resolution is a central problem in language comprehension. Lexical and syntactic ambiguities are standardly assumed to involve different types of knowledge representations and be resolved by different mechanisms. An alternative account is provided in which both types of ambiguity derive
Realtime american sign language recognition using desk and wearable computer based video
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 1998
"... We present two realtime hidden Markov modelbased systems for recognizing sentencelevel continuous American Sign Language (ASL) using a single camera to track the user’s unadorned hands. The first system observes the user from a desk mounted camera and achieves 92 percent word accuracy. The secon ..."
Abstract

Cited by 620 (26 self)
 Add to MetaCart
We present two realtime hidden Markov modelbased systems for recognizing sentencelevel continuous American Sign Language (ASL) using a single camera to track the user’s unadorned hands. The first system observes the user from a desk mounted camera and achieves 92 percent word accuracy
Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming
 Journal of the ACM
, 1995
"... We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds the solution ..."
Abstract

Cited by 1231 (13 self)
 Add to MetaCart
We present randomized approximation algorithms for the maximum cut (MAX CUT) and maximum 2satisfiability (MAX 2SAT) problems that always deliver solutions of expected value at least .87856 times the optimal value. These algorithms use a simple and elegant technique that randomly rounds
Predicting Transmembrane Protein Topology with a Hidden Markov Model: Application to Complete Genomes
 J. MOL. BIOL
, 2001
"... ..."
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts
Results 1  10
of
478,391