59 search results - page 9 / 12 » Prime Implicates and Prime Implicants in Modal Logic |
LOGCOM
2002
13 years 8 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
CHI
2008
ACM
14 years 9 months ago
2008
ACM
Individuals with cognitive deficits and their families are prime examples of collaborative "systems" that seek to perform everyday tasks together. Yet there has been lit...
FCT
2005
Springer
14 years 2 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
IMA
2005
Springer
14 years 2 months ago
2005
Springer
In recent years cryptographic protocols based on the Weil and Tate pairings on elliptic curves have attracted much attention. A notable success in this area was the elegant solutio...
ECAI
2000
Springer
14 years 27 days ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Com...