55,552 Hits in 2.8 sec

Concept Learning and the Problem of Small Disjuncts

Robert C. Holte, Liane Acker, Bruce W. Porter
1989 International Joint Conference on Artificial Intelligence  
The problem with small disjuncts is that many of them have high rates of misclassification, and it is difficult to eliminate the errorprone small disjuncts from a definition without adversely affecting  ...  Ideally, definitions induced from examples should consist of all, and only, disjuncts that are meaningful (e.g., as measured by a statistical significance test) and have a low error rate.  ...  We are especially grateful to Peter Clark, of the Turing Institute (Glasgow), who provided the source for CN2, the definitions it produced on the lymphography dataset, and the KPa7KR dataset generated by  ... 
dblp:conf/ijcai/HolteAP89 fatcat:tgbtjcr64nf6vmpe7osvxumneu

Page 341 of MIND Vol. 1, Issue 3 [page]

1892 MIND  
By repeated application of this rule, we may eliminate « from a conjunction of any number of simple disjunctives. Thus :— x Le re TY =... aC ag ce ey.  ...  The required determinant is found by disjoining every term disjoined with # with every term disjoined with z. Again, we may eliminate in the same way any number of terms, x,y, &c.  ... 

Page 392 of The Journal of the Operational Research Society Vol. 43, Issue 5 [page]

1992 The Journal of the Operational Research Society  
Dividing (23) through by a,, the full condition is then captured in a finite manner by the disjunction x (Gig Agj — Aggy )X; > (Gighy — Axqgb;) + Agt), i€G, KEL (21) j=0 wen gayntl — >) 4x; = b,-t; (moda  ...  The ‘disjunctive’ formulations produced ‘by Jeroslow® are sharper than conven- tional formulations in the sense that the LP relaxation has a smaller feasible region.  ... 

DisLoP: A disjunctive logic programming system based on PROTEIN theorem prover [chapter]

Chandrabose Aravindan
1996 Lecture Notes in Computer Science  
PROTEIN supports certain theorem proving calculi, such as restart model elimination and hyper tableaux, that are suitable for working with positive disjunctive logic programs.  ...  only one involved in this project and is just reporting the work done by all members of DisLoP project.  ...  This project on disjunctive logic programming is sponsored by DFG under the grant number Fu 263/3-1.  ... 
doi:10.1007/3-540-61708-6_42 fatcat:slgggh7mwfgpjoc7rwt3rnrcqy

Page 477 of Genetics Vol. 5, Issue 5 [page]

1920 Genetics  
STERILITY OF THE XO MALE PRODUCED BY PRIMARY NON-DISJUNCTION As already stated, Brmpces had tested fifteen primary exceptions and had found them all to be sterile.  ...  Only two cultures among the thirty-two tested gave secondary exceptions, which is in conformity with the very rare formation of XX eggs by primary non-disjunctions.  ... 


M. Demerec, J. G. Farrow
1930 Proceedings of the National Academy of Sciences of the United States of America  
PRIMARY NON-DISJUNCTIONS. Frequency.-Data on the frequency of primary non-disjunctions were obtained by breeding F1 females from crosses involving several sex-linked characters.  ...  That precaution made it certain that these females were not non-disjunctional and to a large extent eliminated the possibility of inclusion in the results of secondary non-disjunctions.  ...  That precaution made it certain that these females were not non-disjunctional and to a large extent eliminated the possibility of inclusion in the results of secondary non-disjunctions.  ... 
doi:10.1073/pnas.16.11.707 pmid:16577296 pmcid:PMC526721 fatcat:pvtqe7kldbebtamqpga76b2mue

Comparisons and computation of well-founded semantics for disjunctive logic programs

Kewen Wang, Lizhu Zhou
2005 ACM Transactions on Computational Logic  
We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some existing approaches to defining disjunctive  ...  By employing the techniques developed by Brass and Dix in their transformationbased approach, we also provide a bottom-up procedure for this semantics.  ...  The new set T * WFS of program transformations is obtained by replacing the Elimination of nonminimal rules in T WFS by the Elimination of s-implications (In the sequel, P 1 and P 2 are disjunctive programs  ... 
doi:10.1145/1055686.1055690 fatcat:vsbmt5xnd5bnpa7af7tggyw26a

An Extended Generalized Disjunctive Paraconsistent Data Model for Disjunctive Information [article]

Haibin Wang, Hao Tian, Rajshekhar Sunderraman
2004 arXiv   pre-print
This paper presents an extension of generalized disjunctive paraconsistent relational data model in which pure disjunctive positive and negative information as well as mixed disjunctive positive and negative  ...  We consider explicit mixed disjunctive information in the context of disjunctive databases as there is an interesting interplay between these two types of information.  ...  This redundancy is eliminated by deleteing the pair tuple sets v, x from R M .  ... 
arXiv:cs/0410053v1 fatcat:dqda33dgzfejjn5rig753cy6ma

The Complexity of Disjunction in Intuitionistic Logic [chapter]

R. Ramanujam, Vaishnavi Sundararajan, S. P. Suresh
2015 Lecture Notes in Computer Science  
These are required to be efficient, and are typically disjunction-free. In this paper, we study the complexity of adding disjunction to these subsystems.  ...  Our lower bound results show that very little needs to be added to disjunction to get co-NP-hardness, while our upper bound results show that even a system with conjunction, disjunction, and restricted  ...  number of disjunction eliminations allowed.  ... 
doi:10.1007/978-3-319-27683-0_24 fatcat:n4qfooiqmjei3n4dbaoi2t54zu

Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs [article]

Kewen Wang, Lizhu Zhou
2003 arXiv   pre-print
We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some exisitng approaches to defining disjunctive  ...  In this paper we look at disjunctive well-founded reasoning from different angles.  ...  This work was supported by DFG under grant FOR 375/1-1, TP C. NSFC under grant 69883008.  ... 
arXiv:cs/0301010v2 fatcat:pqrthet7zna67aijmovawmw2xy

Lexical Acquisition via Constraint Solving [article]

Ted Pedersen, Weidong Chen
1995 arXiv   pre-print
Our method reduces the search space of the lexical acquisition problem by utilizing both the left and the right context of the unknown word.  ...  It is possible to greatly reduce the number of candidate disjuncts by analyzing the disjuncts for the known words. Those disjuncts that violate the constraints of the meta-rules are eliminated.  ...  The disjunct ((A,Ds,Os)( )) for 'meat' can also be eliminated. If the A connector is to be satisfied it would have to be satisfied by 'snipe'.  ... 
arXiv:cmp-lg/9502028v1 fatcat:fpfoxx675rb5fccxxkabbwkmju

An abductive framework for negation in disjunctive logic programming [chapter]

Chandrabose Aravindan
1996 Lecture Notes in Computer Science  
In this paper, we study an abductive framework for disjunctive logic programming that provides a new way to understand negation in disjunctive logic programming.  ...  To demonstrate this, we show how a theorem prover, based on restart model elimination calculus, can be modi ed for abductive reasoning and thus for minimal model reasoning.  ...  This research is part of project on Disjunctive Logic Programming 4 , undertaken by the AI research group at the Universit at Koblenz-Landau, and funded by DFG.  ... 
doi:10.1007/3-540-61630-6_18 fatcat:ftwaeinrq5dc3jmtgkiioag5qe

Page 563 of Genetics Vol. 14, Issue 6 [page]

1929 Genetics  
That such non-disjunctions may occur in haploids is suggested by the relatively high percentages of non-disjunctional types produced by a hap- loid (BLAKESLEE, Morrison and Avery 1927), although their  ...  A third possible explanation is that these unger- minated pollen grains, together with the pollen tubes which burst in the style, represent pollen grains with 13 or 11 chromosomes, brought about by non-disjunction  ... 

Characterizations of the disjunctive stable semantics by partial evaluation

Stefan Brass, Jürgen Dix
1997 The Journal of Logic Programming  
class of all disjunctive programs).  ...  positive programs, and (2) if SEM satisfies in addition Elimination of Contradictions, it is based on stable models.  ...  Stable models for all disjunctive programs are obtained by still adding Elimination of Contradictions (see Theorem 4.4) .  ... 
doi:10.1016/s0743-1066(96)00115-x fatcat:zo37276qerhphmj66yiktynrfm

Efficient algorithms for qualitative reasoning about time

Alfonso Gerevini, Lenhart Schubert
1995 Artificial Intelligence  
The algorithms herein enable construction of a timegraph from a given set of PArelations, querying a timegraph, and efficiently checking the consistency of a timegraph augmented by a set of PA-disjunctions  ...  We focus on the class of relations forming the Point Algebra (PA-relations) and on a major extension to include binary disjunctions of PA-relations (PA-disjunctions).  ...  The second author was supported by Rome Lab Contract F30602-91-C-0010 and Boeing Contract W88104.  ... 
doi:10.1016/0004-3702(94)00016-t fatcat:xoqk6bpgzree3pmlun73etbapq
« Previous Showing results 1 — 15 out of 55,552 results