Results 1  10
of
449
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
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
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
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 Γ
The complexity of acyclic conjunctive queries
 Journal of the ACM
, 1998
"... This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By wellknown results of Yannakakis [1981], this problem is solvable in polynomial time; its precise complexity, however, has not been pinpointed so far. We show that the problem of evaluating acyc ..."
Abstract

Cited by 96 (21 self)
 Add to MetaCart
complete: The Query Output Tuple problem for conjunctive queries, Conjunctive Query Containment, Clause Subsumption, and Constraint Satisfaction. The LOGCFLcompleteness result is extended to the class of queries of bounded treewidth and to other relevant query classes which are more general than the acyclic queries.
SATISFIABILITY DECAY ALONG CONJUNCTIONS OF PSEUDORANDOM CLAUSES
"... Abstract. kSAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. The problem has many theoretical, algorithmic and practical aspects. When the clauses are chosen at random it is anticipa ..."
Abstract
 Add to MetaCart
Abstract. kSAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. The problem has many theoretical, algorithmic and practical aspects. When the clauses are chosen at random
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
of constraint solvers. In our approach, constraint evaluation is specified using multiheaded guarded clauses called constraint handling rules (CHRs). CHRs define determinate conditional rewrite systems that express how conjunctions of constraints propagate and simplify. In this paper we concentrate on CHRs
Labelled Clauses
"... Abstract. We add labels to firstorder clauses to simultaneously apply superpositions to several proof obligations inside one clause set. From a theoretical perspective, the approach unifies a variety of deduction modes. These include different strategies such as set of support, as well as explicit ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
case analysis, e.g., splitting. From a practical perspective, labelled clauses offer advantages in the case of related proof obligations resulting from multiple conjectures over the same axiom set or from a single conjecture that is a large conjunction. Here we can share clauses (e.g., the axioms
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
(or revised) knowledge base. This problem amounts to evaluating the counterfactual p > q over T . Besides the general case, also subcases are considered, in particular where T is a conjunction of Horn clauses, or where the size of p is bounded by a constant.
The use of the Afrikaans conjunction "wanneer" (when) in subordinate clause embedding
, 2008
"... ABSTRACT The use of the Afrikaans conjunction "wanneer" (when) in subordinate clause embedding The Afrikaans conjunction "wanneer" (when) ..."
Abstract
 Add to MetaCart
ABSTRACT The use of the Afrikaans conjunction "wanneer" (when) in subordinate clause embedding The Afrikaans conjunction "wanneer" (when)
Translating Propositional Extended Conjunctions of Horn Clauses into Boolean Circuits
"... Abstract Horn ⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of structuring programs in logic programming. We are interested in finding correct and efficient translations from H ..."
Abstract
 Add to MetaCart
.e. trees; and into conjunctions of propositional Horn clauses. Different results about the efficiency of the transformations are obtained in the three cases.
Results 1  10
of
449