Search results for "3-clauses"

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