The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for clauses with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1960-1978 (15) 1979-1983 (18) 1984-1985 (28) 1986 (22) 1987 (31) 1988 (36) 1989 (25) 1990 (43) 1991 (35) 1992 (48) 1993 (36) 1994 (45) 1995 (26) 1996 (33) 1997 (29) 1998 (52) 1999 (48) 2000 (61) 2001 (61) 2002 (79) 2003 (81) 2004 (104) 2005 (117) 2006 (96) 2007 (102) 2008 (86) 2009 (82) 2010 (21) 2011 (19) 2012 (16) 2013 (22) 2014 (21) 2015 (29) 2016 (30) 2017 (24) 2018 (32) 2019 (24) 2020 (35) 2021 (34) 2022 (36) 2023 (26) 2024 (9)
Publication types (Num. hits)
article(385) book(1) incollection(12) inproceedings(1407) phdthesis(5) proceedings(7)
Venues (Conferences, Journals, ...)
CADE(83) CoRR(71) SAT(65) ILP(40) LPAR(33) CP(29) J. ACM(23) ECML(22) ISMIS(20) CSL(19) ELP(17) ICLP(17) LOPSTR(16) HCVS@ETAPS(15) J. Autom. Reason.(15) FOCS(14) More (+10 of total 619)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 902 occurrences of 575 keywords

Results
Found 1817 publication records. Showing 1817 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
93Reinhard Pichler Extending Decidable Clause Classes via Constraints. Search on Bibsonomy FTP (LNCS Selection) The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
80Shan Chi, Lawrence J. Henschen Recursive Query Answering with Non-Horn Clauses. Search on Bibsonomy CADE The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
77Philippe Chatalic, Laurent Simon Multi-resolution on compressed sets of clauses. Search on Bibsonomy ICTAI The full citation details ... 2000 DBLP  DOI  BibTeX  RDF compressed sets, compressed clauses, propositional clauses, compression power, structured instances, specialized operator, clause sets, polynomial size data structures, ZREs system, Davis-Putnam procedure, hard problems, SAT provers, zero-suppressed binary decision diagrams, computational complexity, data structures, data structures, data compression, theorem proving, computability, encodings, directed graphs, binary decision diagrams, set theory, multi-resolution, cut eliminations, ZBDDs
76Chuang Lin 0002, Abhijit Chaudhury, Andrew B. Whinston, Dan C. Marinescu Logical Inference of Horn Clauses in Petri Net Models. Search on Bibsonomy IEEE Trans. Knowl. Data Eng. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF net model, logical inconsistency check, T-invariants, one-literal, pure-literal, splitting clauses, Petri nets, inference mechanisms, resolution, propositional logic, Horn clauses, Horn clauses, Petri net models, first-order predicate logic, logical inference
73Honglei Zeng, Sheila A. McIlraith The Role of Redundant Clauses in Solving Satisfiability Problems. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
69Flemming Nielson, Helmut Seidl Control-Flow Analysis in Cubic Time. Search on Bibsonomy ESOP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Horn clauses with sharing, tiling of Horn clauses, 0-CFA, Program analysis, calculus, ambient calculus
57Helmut Seidl, Kumar Neeraj Verma Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF instantiation-based theorem proving, Cryptographic protocols, first-order logic, resolution, Horn clauses
57Flemming Nielson, Hanne Riis Nielson, Helmut Seidl Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi. Search on Bibsonomy SAS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF uniform Horn clauses, strongly recognizable relations, Program analysis, Spi calculus
54YoungSik Choi, Raghu Krishnapuram Image enhancement based on fuzzy logic. Search on Bibsonomy ICIP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF fuzzy rule based approach, nonimpulse noise smoothing, weighted least mean squared method, antecedent clauses, consequent clauses, fuzzy logic, fuzzy logic, knowledge based systems, filters, image enhancement, image enhancement, experimental results, filtering theory, fuzzy rules, edge enhancement, least mean squares methods, impulse noise removal
52Marina Langlois, Dhruv Mubayi, Robert H. Sloan, György Turán Combinatorial Problems for Horn Clauses. Search on Bibsonomy Graph Theory, Computational Intelligence and Thought The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
52Tal Lev-Ami, Christoph Weidenbach, Thomas W. Reps, Mooly Sagiv Labelled Clauses. Search on Bibsonomy CADE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
52Helmut Seidl, Kumar Neeraj Verma Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses. Search on Bibsonomy Program Analysis and Compilation The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
52Michael Dierkes Simplification of Horn Clauses That Are Clausal Forms of Guarded Formulas. Search on Bibsonomy LPAR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
52Robert Nieuwenhuis, Albert Rubio Theorem Proving with Ordering Constrained Clauses. Search on Bibsonomy CADE The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
52Gopalan Nadathur, Dale Miller 0001 Higher-Order Horn Clauses Search on Bibsonomy J. ACM The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
52Hans-Jürgen Bürckert A Resolution Principle for Clauses with Constraints. Search on Bibsonomy CADE The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
50Serge Gaspers, Gregory B. Sorkin A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
50Kun-Lung Wu, Philip S. Yu Efficient query monitoring using adaptive multiple key hashing. Search on Bibsonomy CIKM The full citation details ... 2002 DBLP  DOI  BibTeX  RDF adaptive multiple key hashing, query monitoring, publish/subscribe, continual queries, query indexing
50Tamás Horváth 0001, Stefan Wrobel Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity. Search on Bibsonomy Discovery Science The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
45Éric Grégoire, Bertrand Mazure, Cédric Piette On Approaches to Explaining Infeasibility of Sets of Boolean Clauses. Search on Bibsonomy ICTAI (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
45Jong Hyun Park, Ji-Hoon Kang Optimization of XQuery Queries Including FOR Clauses. Search on Bibsonomy ICIW The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Query Optimization, XQuery, Query rewriting
45Georgiana Puscasu, Patricio Martínez-Barco, Estela Saquete On the Identification of Temporal Clauses. Search on Bibsonomy MICAI The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Alex Chengyu Fang A Corpus-Based Empirical Account of Adverbial Clauses Across Speech and Writing in Contemporary British English. Search on Bibsonomy FinTAL The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
45Megumi Kuwabara, Takeshi Ogawa, Kouichi Hirata, Masateru Harao On Generalization and Subsumption for Ordered Clauses. Search on Bibsonomy JSAI Workshops The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
45Ronen I. Brafman A simplifier for propositional formulas with many binary clauses. Search on Bibsonomy IEEE Trans. Syst. Man Cybern. Part B The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Zdravko Markov, Ivo Marinchev Coverage-Based Semi-distance between Horn Clauses. Search on Bibsonomy AIMSA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
45Peter Barth Linear 0-1 Inequalities and Extended Clauses. Search on Bibsonomy LPAR The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
43Christopher Lynch, Duc-Khanh Tran SMELS: Satisfiability Modulo Equality with Lazy Superposition. Search on Bibsonomy ATVA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
43Miroslav N. Velev Exploiting Signal Unobservability for Efficient Translation to CNF in Formal Verification of Microprocessors. Search on Bibsonomy DATE The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Marta Arias, Roni Khardon The Subsumption Lattice and Query Learning. Search on Bibsonomy ALT The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Mathieu Serrurier, Henri Prade, Gilles Richard A Simulated Annealing Framework for ILP. Search on Bibsonomy ILP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
43Christopher Lynch Schematic Saturation for Decision and Unification Problems. Search on Bibsonomy CADE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
43Michael Dierkes An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas. Search on Bibsonomy Computational Logic The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
43Henrik Boström Specialization of Recursive Predicates. Search on Bibsonomy ECML The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
43Wai-Keong Foong Or-Parallel Prolog with Heuristic Task Distribution. Search on Bibsonomy RCLP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
43Kam-Fai Wong, M. Howard Williams Limiting a Resolution Set in a Large Prolog Database Using Special Hardware. Search on Bibsonomy SIGSMALL/PC The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Prolog
43Toshiro Wakayama, T. H. Payne Case Inference in Resolution-Based Languages. Search on Bibsonomy CADE The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
43Larry Wos, Ross A. Overbeek, Lawrence J. Henschen Hyperparamodulation: A Refinement of Paramodulation. Search on Bibsonomy CADE The full citation details ... 1980 DBLP  DOI  BibTeX  RDF
42Dong-Bo Liu, Zheng-ding Lu The Theory of Fuzzy Logic Programming. Search on Bibsonomy ICFIE The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Fuzzy Horn Clauses, Fuzzy Proof Theory, Fuzzy Procedural Interpretation, Fuzzy Logic Programming
42Adel Bouhoula, Jean-Pierre Jouannaud Automata-Driven Automated Induction. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF automata-driven automated induction, inductive theorem proving, first-order functions, finitely many unary membership predicates, rational subsets, ground reducibility, inductive prover, theorem proving, tree automata, Horn Clauses, proof obligations
37Kishore Varma Indukuri, P. Radha Krishna 0001 Mining e-contract documents to classify clauses. Search on Bibsonomy Bangalore Compute Conf. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF data mining, e-contracts, text analytics
37Helmut Seidl, Kumar Neeraj Verma Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case. Search on Bibsonomy RTA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
37Christoffer Rosenkilde Nielsen, Flemming Nielson, Hanne Riis Nielson Iterative Specialisation of Horn Clauses. Search on Bibsonomy ESOP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
37Sang-Soo Kim, Seong-Bae Park, Sang-Jo Lee Dependency Analysis of Clauses Using Parse Tree Kernels. Search on Bibsonomy CICLing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Xianfei Tang, Changjun Jiang, Zhijun Ding Automatic Web Service Composition Based on Logical Inference of Horn Clauses in Petri Net Models. Search on Bibsonomy ICWS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Mi-Young Kim Determining the Dependency Among Clauses Based on Machine Learning Techniques. Search on Bibsonomy ICANNGA (1) The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
37Mark Goadrich, Louis Oliphant, Jude W. Shavlik Gleaner: Creating ensembles of first-order clauses to improve recall-precision curves. Search on Bibsonomy Mach. Learn. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Recall-precision curves, Biomedical information extraction, Ensembles, Inductive logic programming
37Sylvain Darras, Gilles Dequen, Laure Devendeville, Bertrand Mazure, Richard Ostrowski, Lakhdar Sais Using Boolean Constraint Propagation for Sub-clauses Deduction. Search on Bibsonomy CP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
37Helmut Seidl, Kumar Neeraj Verma Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. Search on Bibsonomy LPAR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Mark Goadrich, Louis Oliphant, Jude W. Shavlik Learning Ensembles of First-Order Clauses for Recall-Precision Curves: A Case Study in Biomedical Information Extraction. Search on Bibsonomy ILP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Eugene Nudelman, Kevin Leyton-Brown, Holger H. Hoos, Alex Devkar, Yoav Shoham Understanding Random SAT: Beyond the Clauses-to-Variables Ratio. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
37Oliver Kullmann The Combinatorics of Conflicts between Clauses. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
37Jacob M. Howe, Andy King Positive Boolean Functions as Multiheaded Clauses. Search on Bibsonomy ICLP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Boolean functions, interpretation, groundness analysis, (constraint) logic programs
37Xumin Nie, Qing Guo Renaming a Set of Non-Horn Clauses. Search on Bibsonomy ISMIS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
37Laurent Fribourg Oriented Equational Clauses as a Programming Language. Search on Bibsonomy ICALP The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
36Gilberto Filé, Roberto Vigo Expressive Power of Definite Clauses for Verifying Authenticity. Search on Bibsonomy CSF The full citation details ... 2009 DBLP  DOI  BibTeX  RDF definite clauses, authenticity, security protocols, protocol verification
36Dana Angluin, Michael Frazier, Leonard Pitt Learning Conjunctions of Horn Clauses (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF clauses, Horn clause conjunctions, Horn sentence, disjunction of literals, negated variable, unknown formula, learning algorithm, Boolean formulas, polynomial time complexity, membership queries, equivalence queries
36Stefan Porschen, Tatjana Schmidt On Some SAT-Variants over Linear Formulas. Search on Bibsonomy SOFSEM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF not-all-equal satisfiability, exact satisfiability, linear formula, linear hypergraph, bicolorability
36Roman Gershman, Maya Koifman, Ofer Strichman An approach for extracting a small unsatisfiable core. Search on Bibsonomy Formal Methods Syst. Des. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Unsatisfiable core, SAT, Resolution
36Federico Heras, Javier Larrosa, Albert Oliveras MiniMaxSat: A New Weighted Max-SAT Solver. Search on Bibsonomy SAT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Sylvain Darras, Gilles Dequen, Laure Devendeville, Chu Min Li On Inconsistent Clause-Subsets for Max-SAT Solving. Search on Bibsonomy CP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Unit Propagation, Inconsistent Subset, Max-SAT
36Roman Gershman, Maya Koifman, Ofer Strichman Deriving Small Unsatisfiable Cores with Dominators. Search on Bibsonomy CAV The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Swaha Miller, David A. Plaisted The Space Efficiency of OSHL. Search on Bibsonomy TABLEAUX The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
36Katsumi Inoue Induction as Consequence Finding. Search on Bibsonomy Mach. Learn. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF consequence finding, inverse entailment, induction, abduction
36Daniel Král Locally satisfiable formulas. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
36Miroslav N. Velev Efficient translation of boolean formulas to CNF in formal verification of microprocessors. Search on Bibsonomy ASP-DAC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
36Uriel Feige, Eran Ofek Easily Refutable Subformulas of Large Random 3CNF Formulas. Search on Bibsonomy ICALP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
36Peter A. Flach, Nada Lavrac Learning in Clausal Logic: A Perspective on Inductive Logic Programming. Search on Bibsonomy Computational Logic: Logic Programming and Beyond The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
36Jacobo Torán Lower Bounds for Space in Resolution. Search on Bibsonomy CSL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF lower bounds, Resolution, space, complexity measures, pebbling game
36Eric McCreath, Arun Sharma 0001 LIME: A System for Learning Relations. Search on Bibsonomy ALT The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
36Daniele Gunetti, Umberto Trinchero Intensional Learning of Logic Programs. Search on Bibsonomy ECML The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
36Allen L. Brown Jr., Surya Mantha, Toshiro Wakayama A Logical Reconstruction of Constraint Relaxation Hierarchies in Logic Programming. Search on Bibsonomy ISMIS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
36Lawrence J. Henschen, Larry Wos Unit Refutations and Horn Sets. Search on Bibsonomy J. ACM The full citation details ... 1974 DBLP  DOI  BibTeX  RDF
34Flemming Nielson, Hanne Riis Nielson, Helmut Seidl Automatic Complexity Analysis. Search on Bibsonomy ESOP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF automatic complexity analysis, Program analysis, sparseness, Horn clauses
34Chao-Chih Yang Deduction Graphs: An Algorithm and Applications. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF deduction graph, function-free Horn formula, logic queries, artificial intelligence, logic programming, logic programming, relational database, relational databases, expert systems, database theory, inference mechanisms, functional dependency, Horn clauses, polynomial time complexity, rule-based expert systems, inference problem
32Silke Brandt, Stephanie Hargreaves, Anna L. Theakston Putting Complement Clauses into Context: Testing the Effects of Story Context, False-Belief Understanding, and Syntactic form on Children's and Adults' Comprehension and Production of Complement Clauses. Search on Bibsonomy Cogn. Sci. The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
32Zineddine Tighidet, Nicolas Ballier Fine-tuning a Subtle Parsing Distinction Using a Probabilistic Decision Tree: the Case of Postnominal "that" in Noun Complement Clauses vs. Relative Clauses. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
32Julien Braine The Data-abstraction Framework: abstracting unbounded data-structures in Horn clauses, the case of arrays. (La Méthode Data-abstraction: une technique d'abstraction de structures de données non-bornées dans des clauses de Horn, le cas des tableaux). Search on Bibsonomy 2022   RDF
32Bishoksan Kafle, John P. Gallagher, Manuel V. Hermenegildo, Maximiliano Klemen, Pedro López-García 0001, José F. Morales 0001 Regular Path Clauses and Their Application in Solving Loops. Search on Bibsonomy HCVS@ETAPS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
32Jerome Jochems Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses. Search on Bibsonomy HCVS@ETAPS The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
32Ting Liu, Yang Xu, Xiulan Chen 命题逻辑中单元子句及其负文字和冗余子句 (Unit Clauses and Their Complementary Literals and Redundant Clauses in Propositional Logic). Search on Bibsonomy 计算机科学 The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
32Qi Zhou 0010, William Harris Solving Constrained Horn Clauses Using Dependence-Disjoint Expansions. Search on Bibsonomy HCVS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
32Bishoksan Kafle, John P. Gallagher, Pierre Ganty Solving non-linear Horn clauses using a linear Horn clause solver. Search on Bibsonomy HCVS@ETAPS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
32Pierre-Loïc Garoche, Temesghen Kahsai, Xavier Thirioux Hierarchical State Machines as Modular Horn Clauses. Search on Bibsonomy HCVS@ETAPS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
32Hossein Hojjat, Philipp Rümmer, Pavle Subotic, Wang Yi 0001 Horn Clauses for Communicating Timed Systems. Search on Bibsonomy HCVS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
32Ashutosh Gupta 0001, Corneliu Popeea, Andrey Rybalchenko Generalised Interpolation by Solving Recursion-Free Horn Clauses Search on Bibsonomy HCVS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
32Jia Meng, Lawrence C. Paulson Translating Higher-Order Clauses to First-Order Clauses. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Interactive theorem provers, Clause translation, First-order logic, Higher-order logic
32Cecile T. Balkanski Actions, Beliefs and Intentions in Rationale Clauses and Means Clauses. Search on Bibsonomy AAAI The full citation details ... 1992 DBLP  BibTeX  RDF
32Cecile T. Balkanski Action Relations In Rationale Clauses And Means Clauses. Search on Bibsonomy COLING The full citation details ... 1992 DBLP  BibTeX  RDF
32María-Blanca Ibáñez-Espiga Inférence parallèle et processus communicants pour les clauses de Horn : extension au premier ordre par la méthode de connexion. (Parallel inference and communicating processes for the Horn clauses). Search on Bibsonomy 1990   RDF
30Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Sais Eliminating Redundant Clauses in SAT Instances. Search on Bibsonomy CPAIOR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Mark Goadrich, Jude W. Shavlik Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates. Search on Bibsonomy ILP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
30Chiheb Mahmoud, Frédéric Dimanche Best Price Guarantee Clauses: French Riviera Hotels versus Web Based Intermediaries. Search on Bibsonomy ENTER The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
30Sebastian van Delden Simple But Useful Algorithms for Identifying Noun Phrase Complements of Embedded Clauses in a Partial Parse. Search on Bibsonomy NLDB The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Kumar Neeraj Verma, Helmut Seidl, Thomas Schwentick On the Complexity of Equational Horn Clauses. Search on Bibsonomy CADE The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Venkatesan Guruswami, Subhash Khot Hardness of Max 3SAT with No Mixed Clauses. Search on Bibsonomy CCC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Flaviu Adrian Marginean Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?. Search on Bibsonomy ILP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Alan Hutchinson Metrics on Terms and Clauses. Search on Bibsonomy ECML The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
30R. Ramesh 0001, I. V. Ramakrishnan, David Scott Warren Automata-Driven Indexing of Prolog Clauses. Search on Bibsonomy POPL The full citation details ... 1990 DBLP  DOI  BibTeX  RDF Prolog
30Thierry Boy de la Tour Minimizing the Number of Clauses by Renaming. Search on Bibsonomy CADE The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1817 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license