Results 1  10
of
407
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 855 (68 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
DISJUNCTION
"... In this paper I propose a more general framework for tableauxlike first order classical deductions in which bottomup inferences find a natural place. The result is a new system of proof for classical first order logic with many interesting normal form properties. Restricting myself to classical pr ..."
Abstract
 Add to MetaCart
) are in an obvious sense 'elimination ' rules. In general, an elimination rule for a logical constant * allows an inference from a formula that has • as principal operator, i.e. an instance of such a rule has a (major) premiss P which has * as principal operator. In an application of such a rule
Learning Decision Lists
, 2001
"... This paper introduces a new representation for Boolean functions, called decision lists, and shows that they are efficiently learnable from examples. More precisely, this result is established for \kDL" { the set of decision lists with conjunctive clauses of size k at each decision. Since k ..."
Abstract

Cited by 427 (0 self)
 Add to MetaCart
kDL properly includes other wellknown techniques for representing Boolean functions such as kCNF (formulae in conjunctive normal form with at most k literals per clause), kDNF (formulae in disjunctive normal form with at most k literals per term), and decision trees of depth k, our result
A FormulaeasTypes Notion of Control
 In Conference Record of the Seventeenth Annual ACM Symposium on Principles of Programming Languages
, 1990
"... The programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with firstclass labels and jumps. We show that the wellknown formulaeastypes correspondence, which relates a constr ..."
Abstract

Cited by 294 (0 self)
 Add to MetaCart
The programming language Scheme contains the control construct call/cc that allows access to the current continuation (the current control context). This, in effect, provides Scheme with firstclass labels and jumps. We show that the wellknown formulaeastypes correspondence, which relates a
Loop Formulas for Disjunctive Logic Programs
 In Proc. ICLP03
, 2003
"... We extend Clark's de nition of a completed program and the de nition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completi ..."
Abstract

Cited by 59 (10 self)
 Add to MetaCart
We extend Clark's de nition of a completed program and the de nition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its
Automata for the µcalculus and Related Results
, 1995
"... The propositional µcalculus as introduced by Kozen in [4] is considered. The notion of disjunctive formula is defined and it is shown that every formula is semantically equivalent to a disjunctive formula. For these ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
The propositional µcalculus as introduced by Kozen in [4] is considered. The notion of disjunctive formula is defined and it is shown that every formula is semantically equivalent to a disjunctive formula. For these
Disjunctive Normal Form for EventRecording Logic
"... Abstract. We consider the semantics equivalence between formulas and formulas in disjunctive normal form. In the settings of the standard µcalculus, formulas and disjunctive formulas are equivalent. This question is open for timed extensions of the µcalculus. Sorea has introduced a timed µcalculu ..."
Abstract
 Add to MetaCart
Abstract. We consider the semantics equivalence between formulas and formulas in disjunctive normal form. In the settings of the standard µcalculus, formulas and disjunctive formulas are equivalent. This question is open for timed extensions of the µcalculus. Sorea has introduced a timed µ
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
"... Abstract. Predicate encryption is a new paradigm generalizing, among other things, identitybased encryption. In a predicate encryption scheme, secret keys correspond to predicates and ciphertexts are associated with attributes; the secret key SKf corresponding to a predicate f can be used to decryp ..."
Abstract

Cited by 173 (23 self)
 Add to MetaCart
, in turn, enables constructions in which predicates correspond to the evaluation of disjunctions, polynomials, CNF/DNF formulae, or threshold predicates (among others). Besides serving as a significant step forward in the theory of predicate encryption, our results lead to a number of applications
On the Computational Cost of Disjunctive Logic Programming: Propositional Case
, 1995
"... This paper addresses complexity issues for important problems arising with disjunctive logic programming. In particular, the complexity of deciding whether a disjunctive logic program is consistent is investigated for a variety of wellknown semantics, as well as the complexity of deciding whethe ..."
Abstract

Cited by 141 (26 self)
 Add to MetaCart
whether a propositional formula is satised by all models according to a given semantics. We concentrate on nite propositional disjunctive programs with as wells as without integrity constraints, i.e., clauses with empty heads; the problems are located in appropriate slots of the polynomial hierarchy
The Complexity of Minimizing Disjunctive Normal Form Formulas
, 1999
"... Contents 1 Introduction 3 2 Preliminaries 6 3 Computing a Minimum DNF 8 4 NP is Enough 11 5 Minimum Term DNF 13 5.2 The hA; Biversion . . . . . . . . . . . . . . . . . . . . . . . . 17 5.3 Masek's Result . . . . . . . . . . . . . . . . . . . . . . . . . . 18 6 Minimum Length DNF 32 6.1 Length ..."
Abstract
 Add to MetaCart
Contents 1 Introduction 3 2 Preliminaries 6 3 Computing a Minimum DNF 8 4 NP is Enough 11 5 Minimum Term DNF 13 5.2 The hA; Biversion . . . . . . . . . . . . . . . . . . . . . . . . 17 5.3 Masek's Result . . . . . . . . . . . . . . . . . . . . . . . . . . 18 6 Minimum Length DNF 32 6.1 Length vs. Terms . . . . . . . . . . . . . . . . . . . . . . . . . 33 6.2 The Aversion . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 6.3 The hA; Biversion . . . . . . . . . . . . . . . . . . . . . . . . 35 6.4 The full truthtable version . . . . . . . . . . . . . . . . . . . 36 7 Minimum depth DNF 38 7.1 f is a Total Function . . . . . . . . . . . . . . . . . . . . . . . 40 7.2 f is a Partial Function . . . . . . . . . . . . . . . . . . . . . . 42 8 Approximation Hardness 42 8.1 Preserved Solution Values . . . . . . . . . . . . . . . . . . . . 43 8.2 Masek's Reduction . . . . . . . . . . . . . . . . . . . . . . . . 44 8.3 Reductions from X3C . . . . . . . . . . . . . . . . . . . . . . . 4
Results 1  10
of
407