Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
61 | Zhixiang Chen 0001, Steven Homer |
On Learning Counting Functions with Queries. |
COLT |
1994 |
DBLP DOI BibTeX RDF |
|
61 | Xian-He Sun, Nabil Kamel, Lionel M. Ni |
Solving Implication Problems in Database Applications. |
SIGMOD Conference |
1989 |
DBLP DOI BibTeX RDF |
|
60 | Fabrizio Riguzzi |
ALLPAD: approximate learning of logic programs with annotated disjunctions. |
Mach. Learn. |
2008 |
DBLP DOI BibTeX RDF |
Logic programs with annotated disjunctions, Inductive logic programming, Statistical relational learning, Probabilistic logic programming |
60 | Fabrizio Riguzzi |
Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics. |
ICLP |
2008 |
DBLP DOI BibTeX RDF |
Topics Probabilistic Logic Programming, Logic Programs with Annotated Disjunctions, Well Founded Semantics, SLG resolution |
57 | David P. Helmbold, Sandra Panizza, Manfred K. Warmuth |
Direct and Indirect Algorithms for On-line Learning of Disjunctions. |
EuroCOLT |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Pier Luca Lanzi |
An analysis of generalization in XCS with symbolic conditions. |
IEEE Congress on Evolutionary Computation |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Yaron Kanza, Yehoshua Sagiv |
Computing full disjunctions. |
PODS |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Disjunctions of Horn Theories and Their Cores. |
ISAAC |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Thomas Douillard, Christophe Jermann |
Splitting heuristics for disjunctive numerical constraints. |
SAC |
2008 |
DBLP DOI BibTeX RDF |
splitting heuristics, numerical constraints, disjunctions |
36 | Manuel Bodirsky, Jens K. Müller |
The complexity of rooted phylogeny problems. |
ICDT |
2010 |
DBLP DOI BibTeX RDF |
?-categorical structures, computational complexity, Datalog, constraint satisfaction problems, phylogenetic reconstruction |
36 | Armin Wolf, Jacques Robin, Jairson Vitorino |
Adaptive CHR Meets CHRv: An Extended Refined Operational Semantics for CHRv Based on Justifications. |
Constraint Handling Rules |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Matthias Baaz |
Proof Analysis by Resolution. |
TABLEAUX |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Jonathan Katz, Amit Sahai, Brent Waters |
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. |
EUROCRYPT |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Martin Ralbovský, Tomás Kuchar |
Using Disjunctions in Association Mining. |
ICDM |
2007 |
DBLP DOI BibTeX RDF |
GUHA Method, Ferda, Association Mining, Disjunction |
33 | Adam R. Klivans, Alexander A. Sherstov |
A Lower Bound for Agnostically Learning Disjunctions. |
COLT |
2007 |
DBLP DOI BibTeX RDF |
|
33 | Tomi Janhunen, Ilkka Niemelä, Dietmar Seipel, Patrik Simons, Jia-Huai You |
Unfolding partiality and disjunctions in stable model semantics. |
ACM Trans. Comput. Log. |
2006 |
DBLP DOI BibTeX RDF |
disjunctive stable models, partial models, Answer set programming, inference engine, quantified Boolean formulas, minimal models |
33 | Fabrizio Riguzzi |
ALLPAD: Approximate Learning of Logic Programs with Annotated Disjunctions. |
ILP |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe |
Logic Programs with Annotated Disjunctions. |
ICLP |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Fabrizio Riguzzi |
Learning Logic Programs with Annotated Disjunctions. |
ILP |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Peter Auer, Manfred K. Warmuth |
Tracking the Best Disjunction. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
best disjunction tracking, deterministic on-line learning algorithm, k-literal disjunctions, worst-case mistake bounds, learning (artificial intelligence), upper bounds, computational linguistics, randomised algorithms, amortized analysis, Winnow |
27 | David P. Helmbold, Nick Littlestone, Philip M. Long |
Apple Tasting and Nearly One-Sided Learning |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
boolean variables, nearly one-sided learning, apple tasting model, false acceptances, false rejections, learning algorithm, conjunctions, disjunctions |
27 | Uwe Petermann |
An Extended Herbrand Theorem for First-Order Theories with Equality Interpreted in Partial Algebras. |
MFCS |
1989 |
DBLP DOI BibTeX RDF |
Herbrand Disjunctions, Built in Theories, Theorem Proving, Partial Algebras, Connection Method |
24 | Annamaria Bria, Wolfgang Faber 0001, Nicola Leone |
nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver. |
LPNMR |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
A Schemata Calculus for Propositional Logic. |
TABLEAUX |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Anureet Saxena, Pierre Bonami, Jon Lee 0001 |
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Navin Viswanath, Rajshekhar Sunderraman |
Degrees of Exclusivity in Disjunctive Databases. |
ISMIS |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Lengning Liu, Miroslaw Truszczynski |
Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques. |
Constraints An Int. J. |
2007 |
DBLP DOI BibTeX RDF |
Pseudo-Boolean constraints, Boolean satisfiability, Stochastic local search |
24 | Carlo Meghini, Nicolas Spyratos |
Computing Intensions of Digital Library Collections. |
ICFCA |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Walid Bagga, Refik Molva, Stefano Crosta |
Policy-based encryption schemes from bilinear pairings. |
AsiaCCS |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishnan |
BLOSOM: a framework for mining arbitrary boolean expressions. |
KDD |
2006 |
DBLP DOI BibTeX RDF |
data mining, boolean expression, closed itemsets, minimal generator |
24 | Felix Brandt 0001 |
Efficient Cryptographic Protocol Design Based on Distributed El Gamal Encryption. |
ICISC |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Maria Aloni |
Expressing Ignorance or Indifference. |
TbiLLC |
2005 |
DBLP DOI BibTeX RDF |
free choice indefinites, bi-directional optimality theory, disjunction, implicatures |
24 | Sergey Brin, Rajeev Rastogi, Kyuseok Shim |
Mining Optimized Gain Rules for Numeric Attributes. |
IEEE Trans. Knowl. Data Eng. |
2003 |
DBLP DOI BibTeX RDF |
region bucketing, dynamic programming, Association rules, support, confidence, binary space partitioning, gain |
24 | Olivier Lhomme |
An Efficient Filtering Algorithm for Disjunction of Constraints. |
CP |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Rajeev Rastogi, Kyuseok Shim |
Mining Optimized Association Rules with Categorical and Numeric Attributes. |
IEEE Trans. Knowl. Data Eng. |
2002 |
DBLP DOI BibTeX RDF |
optimized association rules, data mining, algorithm, knowledge discovery |
24 | Miguel A. Salido, Federico Barber |
Disjunction of Non-binary and Numeric Constraint Satisfaction Problems. |
CCIA |
2002 |
DBLP DOI BibTeX RDF |
non-binary constraints, Disjunctive constraints, CSPs |
24 | Beitao Li, Edward Y. Chang, Chung-Sheng Li |
Learning Image Query Concepts via Intelligent Sampling. |
ICME |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Kim Marriott, Peter Moulder, Peter J. Stuckey, Alan Borning |
Solving Disjunctive Constraints for Interactive Graphical Applications. |
CP |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Matthias Baaz, Georg Moser |
On a Generalisation of Herbrand's Theorem. |
CSL |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Phokion G. Kolaitis, Moshe Y. Vardi |
Infinitary Logic for Computer Science. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
24 | François Bry |
Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited. |
SIGMOD Conference |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Manfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing |
Existential Quantifiers in Abstract Data Types. |
ICALP |
1979 |
DBLP DOI BibTeX RDF |
|
21 | Markus Hecher, Rafael Kiesel |
Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Yunwei Qi, Suvrajeet Sen |
Correction to: The ancestral Benders' cutting-plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. |
Math. Program. |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Max Gläser, Marc E. Pfetsch |
Sub-Exponential Lower Bounds for Branch-and-Bound with General Disjunctions via Interpolation. |
SODA |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Markus Hecher, Rafael Kiesel |
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions? |
AAAI |
2024 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
(1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error. |
Artif. Intell. |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
(1+1) Genetic Programming With Functionally Complete Instruction Sets Can Evolve Boolean Conjunctions and Disjunctions with Arbitrarily Small Error. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Dimitris Bertsimas, Ryan Cory-Wright, Sean Lo, Jean Pauphilet |
Optimal Low-Rank Matrix Completion: Semidefinite Relaxations and Eigenvector Disjunctions. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Maria Charitidou, Dimos V. Dimarogonas |
Control Barrier Functions for Disjunctions of Signal Temporal Logic Tasks. |
ECC |
2023 |
DBLP BibTeX RDF |
|
21 | Kilian Rückschloß, Felix Weitkämper |
On the Subtlety of Causal Reasoning in Probabilistic Logic Programming: A Bug Report about the Causal Interpretation of Annotated Disjunctions. |
ICLP Workshops |
2023 |
DBLP BibTeX RDF |
|
21 | Adina Camelia Bleotu, Rodica Ivan, Andreea C. Nicolae, Gabriela Bîlbîie, Anton Benz, Mara Panaitescu, Lyn Tieu |
Not all complex disjunctions are alike: On inclusive and conjunctive interpretations in child Romanian. |
CogSci |
2023 |
DBLP BibTeX RDF |
|
21 | Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner |
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. |
EUROCRYPT (2) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Andrei Sipos |
On Extracting Variable Herbrand Disjunctions. |
Stud Logica |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Adrian Wiltz, Dimos V. Dimarogonas |
Handling Disjunctions in Signal Temporal Logic Based Control Through Nonsmooth Barrier Functions. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Eli Towle, James R. Luedtke |
Intersection Disjunctions for Reverse Convex Sets. |
Math. Oper. Res. |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner |
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. |
IACR Cryptol. ePrint Arch. |
2022 |
DBLP BibTeX RDF |
|
21 | Adrian Wiltz, Dimos V. Dimarogonas |
Handling Disjunctions in Signal Temporal Logic Based Control Through Nonsmooth Barrier Functions. |
CDC |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Lizhu Zhang, Gang Li 0037 |
Some Results on the Dominance Relation Between Conjunctions and Disjunctions. |
ICIC (3) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Wen-Chi Yang, Arcchit Jain, Luc De Raedt, Wannes Meert |
Parameter Learning in ProbLog with Annotated Disjunctions. |
IDA |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Aarushi Goel, Matthew Green 0001, Mathias Hall-Andersen, Gabriel Kaptchuk |
Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for Disjunctions. |
EUROCRYPT (2) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Roman Kossak, Bartosz Wcislo |
Disjunctions with Stopping conditions. |
Bull. Symb. Log. |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Tobias Winkler, Maximilian Weininger |
Stochastic Games with Disjunctions of Multiple Objectives (Technical Report). |
CoRR |
2021 |
DBLP BibTeX RDF |
|
21 | Tobias Winkler, Maximilian Weininger |
Stochastic Games with Disjunctions of Multiple Objectives. |
GandALF |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Pengfei Yin, Jinrui Sun, Moyun Wang |
The relative difficulty of negations of conjunctions and disjunctions - a mental model perspective. |
Cogn. Process. |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Aarushi Goel, Matthew Green 0001, Mathias Hall-Andersen, Gabriel Kaptchuk |
Stacking Sigmas: A Framework to Compose Σ-Protocols for Disjunctions. |
IACR Cryptol. ePrint Arch. |
2021 |
DBLP BibTeX RDF |
|
21 | Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl |
Mac'n'Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. |
CRYPTO (4) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang 0002 |
Split cuts from sparse disjunctions. |
Math. Program. Comput. |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Sam Sanders |
Splittings and Disjunctions in Reverse Mathematics. |
Notre Dame J. Formal Log. |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Albert Kim, Atalay Mert Ileri, Sam Madden |
Optimizing Query Predicates with Disjunctions for Column Stores. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
21 | Carsten Baum, Alex J. Malozemoff, Marc B. Rosen, Peter Scholl |
Mac'n'Cheese: Zero-Knowledge Proofs for Arithmetic Circuits with Nested Disjunctions. |
IACR Cryptol. ePrint Arch. |
2020 |
DBLP BibTeX RDF |
|
21 | Matteo Paganelli, Domenico Beneventano, Francesco Guerra 0001, Paolo Sottovia |
Parallelizing Computations of Full Disjunctions. |
Big Data Res. |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Chi-Chuan Chen, Yu-Shiang Su, Yu-Zhen Tu, Joshua Oon Soo Goh |
Default-mode network activation underlies accurate contextual processing of exclusive disjunctions in older but not younger adults. |
NeuroImage |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nikhil Bhargava, Brian C. Williams |
Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty. |
Artif. Intell. |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ana Cristina Quelhas, Célia Rasga, Philip N. Johnson-Laird |
The Analytic Truth and Falsity of Disjunctions. |
Cogn. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk |
The Number of Clones Determined by Disjunctions of Unary Relations. |
Theory Comput. Syst. |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nikhil Bhargava, Brian C. Williams |
Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
21 | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
21 | Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang |
Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. |
Math. Oper. Res. |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mathias Sablé-Meyer, Salvador Mascarenhas |
Assessing the role of matching bias in reasoning with disjunctions. |
CogSci |
2019 |
DBLP BibTeX RDF |
|
21 | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
Evolving boolean functions with conjunctions and disjunctions via genetic programming. |
GECCO |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Manuel Atencia, Jérôme David, Jérôme Euzenat |
Several Link Keys are Better than One, or Extracting Disjunctions of Link Key Candidates. |
K-CAP |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ning Ding 0001 |
On Exactly Learning Disjunctions and DNFs Without Equivalence Queries. |
COCOON |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nikhil Bhargava, Brian C. Williams |
Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty (Extended Abstract). |
IJCAI |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mohammad Shahabsafa, Julio Cesar Goez, Tamás Terlaky |
On pathological disjunctions and redundant disjunctive conic cuts. |
Oper. Res. Lett. |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Andrew Bate, Boris Motik, Bernardo Cuenca Grau, David Tena Cucala, Frantisek Simancik, Ian Horrocks 0001 |
Consequence-Based Reasoning for Description Logics with Disjunctions and Number Restrictions. |
J. Artif. Intell. Res. |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Maicon Douglas Santos Matos, Laurence Rodrigues do Amaral |
Multiple Disjunctions Rule Genetic Algorithm (MDRGA): Inferring Non-Linear IF-THEN Rules in Non-Linear Datasets. |
CEC |
2018 |
DBLP DOI BibTeX RDF |
|
21 | Huisong Li |
Shape Abstractions with Support for Sharing and Disjunctions. (Abstractions de la Forme des Structures de Données Supportant Partage et Disjonctions). |
|
2018 |
RDF |
|
21 | Lyn Tieu, Kazuko Yatsushiro, Alexandre Cremers, Jacopo Romoli, Uli Sauerland, Emmanuel Chemla |
On the Role of Alternatives in the Acquisition of Simple and Complex Disjunctions in French and Japanese. |
J. Semant. |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Davide Rinaldi, Peter Schuster 0001, Daniel Misselbeck-Wessel |
Eliminating Disjunctions by Disjunction Elimination. |
Bull. Symb. Log. |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Tobias Fischer 0002, Marc E. Pfetsch |
Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints. |
Oper. Res. Lett. |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav |
Learning Disjunctions of Predicates. |
CoRR |
2017 |
DBLP BibTeX RDF |
|
21 | Yunwei Qi, Suvrajeet Sen |
The Ancestral Benders' cutting plane algorithm with multi-term disjunctions for mixed-integer recourse decisions in stochastic programming. |
Math. Program. |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang |
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. |
IPCO |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Pierre Bonami, Andrea Lodi 0001, Andrea Tramontani, Sven Wiese |
Cutting Planes from Wide Split Disjunctions. |
IPCO |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav |
Learning Disjunctions of Predicates. |
COLT |
2017 |
DBLP BibTeX RDF |
|
21 | David Carral, Irina Dragoste, Markus Krötzsch |
Restricted Chase (Non)Termination for Existential Rules with Disjunctions. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Kevin McAreavey, Kim Bauters, Weiru Liu, Jun Hong 0001 |
The Event Calculus in Probabilistic Logic Programming with Annotated Disjunctions. |
AAMAS |
2017 |
DBLP BibTeX RDF |
|
21 | Roberto Asín, Marc Bezem, Robert Nieuwenhuis |
Improving IntSat by expressing disjunctions of bounds as linear constraints. |
AI Commun. |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Urszula Bentkowska, Anna Król |
Preservation of fuzzy relation properties based on fuzzy conjunctions and disjunctions during aggregation process. |
Fuzzy Sets Syst. |
2016 |
DBLP DOI BibTeX RDF |
|