Results 1  10
of
912
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
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
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ
Learning conjunctions of Horn clauses
 In Proceedings of the 31st Annual Symposium on Foundations of Computer Science
, 1990
"... Abstract. An algorithm is presented for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses. (A Horn clause is a disjunction of literals, all but at most one of which is a negated variable.) The algorithm uses equivalence queries and membership queries to prod ..."
Abstract

Cited by 121 (13 self)
 Add to MetaCart
Abstract. An algorithm is presented for learning the class of Boolean formulas that are expressible as conjunctions of Horn clauses. (A Horn clause is a disjunction of literals, all but at most one of which is a negated variable.) The algorithm uses equivalence queries and membership queries
On Existentially Quantified Conjunctions of Atomic Formulae of ...
, 1997
"... Sufficient conditions for an 9 , 89 , or 889 prenex L + sentence to be translatable into the variablefree formalism L \Theta will be singled out in what follows. An efficient test based on such conditions will also be described. Through minor modifications of this testing algorithm, o ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Sufficient conditions for an 9 , 89 , or 889 prenex L + sentence to be translatable into the variablefree formalism L \Theta will be singled out in what follows. An efficient test based on such conditions will also be described. Through minor modifications of this testing algorithm, one can obtain the translation when the sufficient conditions are met. 1 Introduction L \Theta is a ground equational formalism that can compete with firstorder predicate logic as a support for number theories as well as for fullblown theories of sets (cf. [TG87]). Superficially, it resembles the relational languages grown inside the database and knowledge base field more than the specification languages inspired by traditional logic. In analogy with firstorder logic, fragments of which have been endowed with an executable semantics, L \Theta has been proposed as a support for programming languages (cf. [BL92] and [FL94]). From the standpoint of automated deduction, L \Theta has the...
Conjunctions of Unate DNF Formulas: Learning and Structure
, 1988
"... A central topic in query learning is to determine which classes of Boolean formulas are efficiently learnable with membership and equivalence queries. We consider the class R k consisting of conjunctions of k unate DNF formulas. This class generalizes the class of kclause CNF formulas, and the cl ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
A central topic in query learning is to determine which classes of Boolean formulas are efficiently learnable with membership and equivalence queries. We consider the class R k consisting of conjunctions of k unate DNF formulas. This class generalizes the class of kclause CNF formulas
Constraint Handling Rules
 Constraint Programming: Basics and Trends, LNCS 910
, 1995
"... . We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination of cons ..."
Abstract

Cited by 224 (33 self)
 Add to MetaCart
. We are investigating the use of a class of logical formulas to define constraint theories and implement constraint solvers at the same time. The representation of constraint evaluation in a declarative formalism greatly facilitates the prototyping, extension, specialization and combination
On the Complexity of Propositional Knowledge Base Revision, Updates, and Counterfactuals
 ARTIFICIAL INTELLIGENCE
, 1992
"... We study the complexity of several recently proposed methods for updating or revising propositional knowledge bases. In particular, we derive complexity results for the following problem: given a knowledge base T , an update p, and a formula q, decide whether q is derivable from T p, the updated (or ..."
Abstract

Cited by 215 (11 self)
 Add to MetaCart
We study the complexity of several recently proposed methods for updating or revising propositional knowledge bases. In particular, we derive complexity results for the following problem: given a knowledge base T , an update p, and a formula q, decide whether q is derivable from T p, the updated
Homomorphisms of Conjunctive Normal Forms
 Discrete Applied Mathematics
, 2003
"... Abstract We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If ϕ : H → F is a homomorphism, then unsatisfiability of H implies unsatisfiability of F . Homomorphisms from F to a subset F of F (endomorphisms) are of special interest, since in ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
Abstract We study homomorphisms of propositional formulas in CNF generalizing symmetries considered by Krishnamurthy. If ϕ : H → F is a homomorphism, then unsatisfiability of H implies unsatisfiability of F . Homomorphisms from F to a subset F of F (endomorphisms) are of special interest, since
Results 1  10
of
912