4513 search results - page 305 / 903 » Logic programming with satisfiability |
157
click to vote
LICS
2012
IEEE
13 years 6 months ago
2012
IEEE
—Interactive theorem provers based on higher-order logic (HOL) traditionally follow the definitional approach, reducing high-level specifications to logical primitives. This al...
230
click to vote
POPL
2005
ACM
16 years 4 months ago
2005
ACM
A lightweight logical approach to race-free sharing of heap storage between concurrent threads is described, based on the notion of permission to access. Transfer of permission be...
121
click to vote
DAC
2003
ACM
16 years 5 months ago
2003
ACM
SAT-based decision procedures for quantifier-free fragments of firstorder logic have proved to be useful in formal verification. These decision procedures are either based on enco...
134
Voted
VLSID
2007
IEEE
16 years 4 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
147
click to vote
JCDL
2006
ACM
15 years 10 months ago
2006
ACM
In this paper we introduce POLAR, a probabilistic objectoriented logical framework for annotation-based information retrieval. In POLAR, the knowledge about digital objects, annot...