Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
61 | Zhixiang Chen 0001, Steven Homer |
On Learning Counting Functions with Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT 1994, New Brunswick, NJ, USA, July 12-15, 1994., pp. 218-227, 1994, ACM, 0-89791-655-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
61 | Xian-He Sun, Nabil Kamel, Lionel M. Ni |
Solving Implication Problems in Database Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, USA, May 31 - June 2, 1989., pp. 185-192, 1989, ACM Press, 978-0-89791-317-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
60 | Fabrizio Riguzzi |
ALLPAD: approximate learning of logic programs with annotated disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Mach. Learn. ![In: Mach. Learn. 70(2-3), pp. 207-223, 2008. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 24th International Conference, ICLP 2008, Udine, Italy, December 9-13 2008, Proceedings, pp. 667-671, 2008, Springer, 978-3-540-89981-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EuroCOLT ![In: Computational Learning Theory, 4th European Conference, EuroCOLT '99, Nordkirchen, Germany, March 29-31, 1999, Proceedings, pp. 138-152, 1999, Springer, 3-540-65701-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
49 | Pier Luca Lanzi |
An analysis of generalization in XCS with symbolic conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Congress on Evolutionary Computation ![In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2007, 25-28 September 2007, Singapore, pp. 2149-2156, 2007, IEEE, 978-1-4244-1339-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
45 | Yaron Kanza, Yehoshua Sagiv |
Computing full disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, pp. 78-89, 2003, ACM, 1-58113-670-6. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
45 | Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino |
Disjunctions of Horn Theories and Their Cores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, pp. 49-58, 1998, Springer, 3-540-65385-6. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
40 | Thomas Douillard, Christophe Jermann |
Splitting heuristics for disjunctive numerical constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008, pp. 140-144, 2008, ACM, 978-1-59593-753-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
splitting heuristics, numerical constraints, disjunctions |
36 | Manuel Bodirsky, Jens K. Müller |
The complexity of rooted phylogeny problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2010, 13th International Conference, Lausanne, Switzerland, March 23-25, 2010, Proceedings, pp. 165-173, 2010, ACM, 978-1-60558-947-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraint Handling Rules ![In: Constraint Handling Rules, Current Research Topics, pp. 48-69, 2008, Springer, 978-3-540-92242-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Matthias Baaz |
Proof Analysis by Resolution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen, Denmark, July 30 - August 1, 2002, Proceedings, pp. 1, 2002, Springer, 3-540-43929-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Jonathan Katz, Amit Sahai, Brent Waters |
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT ![In: Advances in Cryptology - EUROCRYPT 2008, 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, April 13-17, 2008. Proceedings, pp. 146-162, 2008, Springer, 978-3-540-78966-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
33 | Martin Ralbovský, Tomás Kuchar |
Using Disjunctions in Association Mining. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDM ![In: Advances in Data Mining. Theoretical Aspects and Applications, 7th Industrial Conference, ICDM 2007, Leipzig, Germany, July 14-18, 2007, Proceedings, pp. 339-351, 2007, Springer, 978-3-540-73434-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Learning Theory, 20th Annual Conference on Learning Theory, COLT 2007, San Diego, CA, USA, June 13-15, 2007, Proceedings, pp. 409-423, 2007, Springer, 978-3-540-72925-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 7(1), pp. 1-37, 2006. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 16th International Conference, ILP 2006, Santiago de Compostela, Spain, August 24-27, 2006, Revised Selected Papers, pp. 43-45, 2006, Springer, 978-3-540-73846-6. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Joost Vennekens, Sofie Verbaeten, Maurice Bruynooghe |
Logic Programs with Annotated Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP ![In: Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings, pp. 431-445, 2004, Springer, 3-540-22671-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
33 | Fabrizio Riguzzi |
Learning Logic Programs with Annotated Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming, 14th International Conference, ILP 2004, Porto, Portugal, September 6-8, 2004, Proceedings, pp. 270-287, 2004, Springer, 3-540-22941-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Peter Auer, Manfred K. Warmuth |
Tracking the Best Disjunction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 36th Annual Symposium on Foundations of Computer Science, Milwaukee, Wisconsin, USA, 23-25 October 1995, pp. 312-321, 1995, IEEE Computer Society, 0-8186-7183-1. The full citation details ...](Pics/full.jpeg) |
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 ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 33rd Annual Symposium on Foundations of Computer Science, Pittsburgh, Pennsylvania, USA, 24-27 October 1992, pp. 493-502, 1992, IEEE Computer Society, 0-8186-2900-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1989, MFCS'89, Porabka-Kozubnik, Poland, August 28 - September 1, 1989, Proceedings, pp. 408-417, 1989, Springer, 3-540-51486-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings, pp. 477-482, 2009, Springer, 978-3-642-04237-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier |
A Schemata Calculus for Propositional Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TABLEAUX ![In: Automated Reasoning with Analytic Tableaux and Related Methods, 18th International Conference, TABLEAUX 2009, Oslo, Norway, July 6-10, 2009. Proceedings, pp. 32-46, 2009, Springer, 978-3-642-02715-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Anureet Saxena, Pierre Bonami, Jon Lee 0001 |
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings, pp. 17-33, 2008, Springer, 978-3-540-68886-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Navin Viswanath, Rajshekhar Sunderraman |
Degrees of Exclusivity in Disjunctive Databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 17th International Symposium, ISMIS 2008, Toronto, Canada, May 20-23, 2008, Proceedings, pp. 375-380, 2008, Springer, 978-3-540-68122-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
24 | Lengning Liu, Miroslaw Truszczynski |
Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Constraints An Int. J. ![In: Constraints An Int. J. 12(3), pp. 345-369, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Pseudo-Boolean constraints, Boolean satisfiability, Stochastic local search |
24 | Carlo Meghini, Nicolas Spyratos |
Computing Intensions of Digital Library Collections. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFCA ![In: Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings, pp. 66-81, 2007, Springer, 3-540-70828-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Walid Bagga, Refik Molva, Stefano Crosta |
Policy-based encryption schemes from bilinear pairings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AsiaCCS ![In: Proceedings of the 2006 ACM Symposium on Information, Computer and Communications Security, ASIACCS 2006, Taipei, Taiwan, March 21-24, 2006, pp. 368, 2006, ACM, 1-59593-272-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
24 | Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishnan |
BLOSOM: a framework for mining arbitrary boolean expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KDD ![In: Proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Philadelphia, PA, USA, August 20-23, 2006, pp. 827-832, 2006, ACM, 1-59593-339-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICISC ![In: Information Security and Cryptology - ICISC 2005, 8th International Conference, Seoul, Korea, December 1-2, 2005, Revised Selected Papers, pp. 32-47, 2005, Springer, 3-540-33354-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Maria Aloni |
Expressing Ignorance or Indifference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TbiLLC ![In: Logic, Language, and Computation, 6th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2005, Batumi, Georgia, September 12-16, 2005. Revised Selected Papers, pp. 1-20, 2005, Springer, 978-3-540-75143-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 15(2), pp. 324-338, 2003. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 904-908, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Rajeev Rastogi, Kyuseok Shim |
Mining Optimized Association Rules with Categorical and Numeric Attributes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 14(1), pp. 29-50, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCIA ![In: Topics in Artificial Intelligence, 5th Catalonian Conference on AI, CCIA 2002, Castellón, Spain, October 24-25, 2002, Proceedings, pp. 159-172, 2002, Springer, 3-540-00011-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICME ![In: Proceedings of the 2001 IEEE International Conference on Multimedia and Expo, ICME 2001, August 22-25, 2001, Tokyo, Japan, 2001, IEEE Computer Society, 0-7695-1198-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Kim Marriott, Peter Moulder, Peter J. Stuckey, Alan Borning |
Solving Disjunctive Constraints for Interactive Graphical Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings, pp. 361-376, 2001, Springer, 3-540-42863-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Matthias Baaz, Georg Moser |
On a Generalisation of Herbrand's Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings, pp. 469-483, 2001, Springer, 3-540-42554-3. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Phokion G. Kolaitis, Moshe Y. Vardi |
Infinitary Logic for Computer Science. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 19th International Colloquium, ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings, pp. 450-473, 1992, Springer, 3-540-55719-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
24 | François Bry |
Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, USA, May 31 - June 2, 1989., pp. 193-204, 1989, ACM Press, 978-0-89791-317-1. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
24 | Manfred Broy, Walter Dosch, Helmuth Partsch, Peter Pepper, Martin Wirsing |
Existential Quantifiers in Abstract Data Types. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings, pp. 73-87, 1979, Springer, 3-540-09510-1. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.03539, 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 205(1), pp. 841-845, May 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pp. 3747-3764, 2024, SIAM, 978-1-61197-791-2. The full citation details ...](Pics/full.jpeg) |
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? ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2024, Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence, IAAI 2024, Fourteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2014, February 20-27, 2024, Vancouver, Canada, pp. 10535-10543, 2024, AAAI Press. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 319, pp. 103906, June 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.07455, 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2305.12292, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Maria Charitidou, Dimos V. Dimarogonas |
Control Barrier Functions for Disjunctions of Signal Temporal Logic Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECC ![In: European Control Conference, ECC 2023, Bucharest, Romania, June 13-16, 2023, pp. 1-6, 2023, IEEE, 978-3-907144-08-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP Workshops ![In: Proceedings of the International Conference on Logic Programming 2023 Workshops co-located with the 39th International Conference on Logic Programming (ICLP 2023), London, United Kingdom, July 9th and 10th, 2023., 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CogSci ![In: Proceedings of the 45th Annual Meeting of the Cognitive Science Society, CogSci 2023, Sydney, NSW, Australia, July 26-29, 2023, 2023, cognitivesciencesociety.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
21 | Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner |
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (2) ![In: Advances in Cryptology - EUROCRYPT 2023 - 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023, Proceedings, Part II, pp. 347-378, 2023, Springer, 978-3-031-30616-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
21 | Andrei Sipos |
On Extracting Variable Herbrand Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 110(4), pp. 1115-1134, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Adrian Wiltz, Dimos V. Dimarogonas |
Handling Disjunctions in Signal Temporal Logic Based Control Through Nonsmooth Barrier Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.10803, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Eli Towle, James R. Luedtke |
Intersection Disjunctions for Reverse Convex Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 47(1), pp. 297-319, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner |
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2022, pp. 1419, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
21 | Adrian Wiltz, Dimos V. Dimarogonas |
Handling Disjunctions in Signal Temporal Logic Based Control Through Nonsmooth Barrier Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDC ![In: 61st IEEE Conference on Decision and Control, CDC 2022, Cancun, Mexico, December 6-9, 2022, pp. 3237-3242, 2022, IEEE, 978-1-6654-6761-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Lizhu Zhang, Gang Li 0037 |
Some Results on the Dominance Relation Between Conjunctions and Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIC (3) ![In: Intelligent Computing Methodologies - 18th International Conference, ICIC 2022, Xi'an, China, August 7-11, 2022, Proceedings, Part III, pp. 44-54, 2022, Springer, 978-3-031-13831-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Wen-Chi Yang, Arcchit Jain, Luc De Raedt, Wannes Meert |
Parameter Learning in ProbLog with Annotated Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IDA ![In: Advances in Intelligent Data Analysis XX - 20th International Symposium on Intelligent Data Analysis, IDA 2022, Rennes, France, April 20-22, 2022, Proceedings, pp. 378-391, 2022, Springer, 978-3-031-01332-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EUROCRYPT (2) ![In: Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 2022, Proceedings, Part II, pp. 458-487, 2022, Springer, 978-3-031-07084-6. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
21 | Roman Kossak, Bartosz Wcislo |
Disjunctions with Stopping conditions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 27(3), pp. 231-253, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Tobias Winkler, Maximilian Weininger |
Stochastic Games with Disjunctions of Multiple Objectives (Technical Report). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.04604, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
21 | Tobias Winkler, Maximilian Weininger |
Stochastic Games with Disjunctions of Multiple Objectives. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GandALF ![In: Proceedings 12th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2021, Padua, Italy, 20-22 September 2021., pp. 83-100, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cogn. Process. ![In: Cogn. Process. 22(1), pp. 65-76, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2021, pp. 422, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CRYPTO (4) ![In: Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part IV, pp. 92-122, 2021, Springer, 978-3-030-84258-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
21 | Ricardo Fukasawa, Laurent Poirrier, Shenghao Yang 0002 |
Split cuts from sparse disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. Comput. ![In: Math. Program. Comput. 12(2), pp. 295-335, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Sam Sanders |
Splittings and Disjunctions in Reverse Mathematics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Notre Dame J. Formal Log. ![In: Notre Dame J. Formal Log. 61(1), pp. 51-74, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
21 | Albert Kim, Atalay Mert Ileri, Sam Madden |
Optimizing Query Predicates with Disjunctions for Column Stores. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2002.00540, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IACR Cryptol. ePrint Arch. ![In: IACR Cryptol. ePrint Arch. 2020, pp. 1410, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
21 | Matteo Paganelli, Domenico Beneventano, Francesco Guerra 0001, Paolo Sottovia |
Parallelizing Computations of Full Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Big Data Res. ![In: Big Data Res. 17, pp. 18-31, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NeuroImage ![In: NeuroImage 201, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nikhil Bhargava, Brian C. Williams |
Complexity bounds for the controllability of temporal networks with conditions, disjunctions, and uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 271, pp. 1-17, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ana Cristina Quelhas, Célia Rasga, Philip N. Johnson-Laird |
The Analytic Truth and Falsity of Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Cogn. Sci. ![In: Cogn. Sci. 43(9), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk |
The Number of Clones Determined by Disjunctions of Unary Relations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 63(6), pp. 1298-1313, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Nikhil Bhargava, Brian C. Williams |
Complexity Bounds for the Controllability of Temporal Networks with Conditions, Disjunctions, and Uncertainty. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.02307, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
Evolving Boolean Functions with Conjunctions and Disjunctions via Genetic Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.11936, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Oper. Res. ![In: Math. Oper. Res. 44(4), pp. 1264-1285, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mathias Sablé-Meyer, Salvador Mascarenhas |
Assessing the role of matching bias in reasoning with disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CogSci ![In: Proceedings of the 41th Annual Meeting of the Cognitive Science Society, CogSci 2019: Creativity + Cognition + Computation, Montreal, Canada, July 24-27, 2019, pp. 3351, 2019, cognitivesciencesociety.org, 0-9911967-7-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
21 | Benjamin Doerr, Andrei Lissovoi, Pietro S. Oliveto |
Evolving boolean functions with conjunctions and disjunctions via genetic programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2019, Prague, Czech Republic, July 13-17, 2019, pp. 1003-1011, 2019, ACM, 978-1-4503-6111-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
K-CAP ![In: Proceedings of the 10th International Conference on Knowledge Capture, K-CAP 2019, Marina Del Rey, CA, USA, November 19-21, 2019., pp. 61-68, 2019, ACM, 978-1-4503-7008-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Ning Ding 0001 |
On Exactly Learning Disjunctions and DNFs Without Equivalence Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 25th International Conference, COCOON 2019, Xi'an, China, July 29-31, 2019, Proceedings, pp. 153-165, 2019, Springer, 978-3-030-26175-7. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019, pp. 6353-6357, 2019, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
21 | Mohammad Shahabsafa, Julio Cesar Goez, Tamás Terlaky |
On pathological disjunctions and redundant disjunctive conic cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 46(5), pp. 500-504, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 63, pp. 625-690, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CEC ![In: 2018 IEEE Congress on Evolutionary Computation, CEC 2018, Rio de Janeiro, Brazil, July 8-13, 2018, pp. 1-6, 2018, IEEE, 978-1-5090-6017-7. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Semant. ![In: J. Semant. 34(1), pp. 127-152, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Davide Rinaldi, Peter Schuster 0001, Daniel Misselbeck-Wessel |
Eliminating Disjunctions by Disjunction Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Bull. Symb. Log. ![In: Bull. Symb. Log. 23(2), pp. 181-200, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 45(6), pp. 556-560, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav |
Learning Disjunctions of Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.05070, 2017. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 161(1-2), pp. 193-235, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan, Guanyi Wang |
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings, pp. 75-85, 2017, Springer, 978-3-319-59249-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Pierre Bonami, Andrea Lodi 0001, Andrea Tramontani, Sven Wiese |
Cutting Planes from Wide Split Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 19th International Conference, IPCO 2017, Waterloo, ON, Canada, June 26-28, 2017, Proceedings, pp. 99-110, 2017, Springer, 978-3-319-59249-7. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Nader H. Bshouty, Dana Drachsler-Cohen, Martin T. Vechev, Eran Yahav |
Learning Disjunctions of Predicates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COLT ![In: Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7-10 July 2017, pp. 346-369, 2017, PMLR. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | David Carral, Irina Dragoste, Markus Krötzsch |
Restricted Chase (Non)Termination for Existential Rules with Disjunctions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, pp. 922-928, 2017, ijcai.org, 978-0-9992411-0-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, São Paulo, Brazil, May 8-12, 2017, pp. 105-113, 2017, ACM. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
21 | Roberto Asín, Marc Bezem, Robert Nieuwenhuis |
Improving IntSat by expressing disjunctions of bounds as linear constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI Commun. ![In: AI Commun. 29(1), pp. 205-209, 2016. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Sets Syst. ![In: Fuzzy Sets Syst. 291, pp. 98-113, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|