Results 1  10
of
25,769
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2837 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
On berge multiplication for monotone boolean dualization
 In Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, 2008, LNCS 5125
"... Given the prime CNF representation φ of a monotone Boolean function f: {0, 1} n ↦ → {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f. A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from l ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Given the prime CNF representation φ of a monotone Boolean function f: {0, 1} n ↦ → {0, 1}, the dualization problem calls for finding the corresponding prime DNF representation ψ of f. A very simple method (called Berge multiplication [3, Page 52–53]) works by multiplying out the clauses of φ from
Nonmonotone Dualization via Monotone Dualization
"... The nonmonotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f d where f is a general B ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The nonmonotone dualization (NMD) is one of the most essential tasks required for finding hypotheses in various ILP settings, like learning from entailment [1, 2] and learning from interpretations [3]. Its task is to generate an irredundant prime CNF formula ψ of the dual f d where f is a general
Monotone Boolean dualization is in coNP[log² n]
, 2003
"... In 1996, Fredman and Khachiyan [J. Algorithms 21 (1996) 618628] presented a remarkable algorithm for the problem of checking the duality of a pair of monotone Boolean expressions in disjunctive normal form. Their algorithm runs in n time, thus giving evidence that the problem lies in an interme ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
in an intermediate class between P and coNP. In this paper we show that a modified version of their algorithm requires deterministic polynomial time plus O(log n) nondeterministic guesses, thus placing the problem in the class coNP[log² n]. Our nondeterministic version has also the advantage of having a simpler
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Irrelevant Features and the Subset Selection Problem
 MACHINE LEARNING: PROCEEDINGS OF THE ELEVENTH INTERNATIONAL
, 1994
"... We address the problem of finding a subset of features that allows a supervised induction algorithm to induce small highaccuracy concepts. We examine notions of relevance and irrelevance, and show that the definitions used in the machine learning literature do not adequately partition the features ..."
Abstract

Cited by 741 (26 self)
 Add to MetaCart
not only on the features and the target concept, but also on the induction algorithm. We describe a method for feature subset selection using crossvalidation that is applicable to any induction algorithm, and discuss experiments conducted with ID3 and C4.5 on artificial and real datasets.
Symbolic Model Checking for Realtime Systems
 INFORMATION AND COMPUTATION
, 1992
"... We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an ..."
Abstract

Cited by 574 (50 self)
 Add to MetaCart
We describe finitestate programs over realnumbered time in a guardedcommand language with realvalued clocks or, equivalently, as finite automata with realvalued clocks. Model checking answers the question which states of a realtime program satisfy a branchingtime specification (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolically as a fixpoint of a functional on state predicates, without constructing the state space. For this purpose, we introduce a calculus on computation trees over realnumbered time. Unfortunately, many standard program properties, such as response for all nonzeno execution sequences (during which time diverges), cannot be characterized by fixpoints: we show that the expressiveness of the timed calculus is incomparable to the expressiveness of timed CTL. Fortunately, this result does not impair the symbolic verification of "implementable" realtime programsthose whose safety...
Results 1  10
of
25,769