Search results for "conjunctions"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
88	Ildar Z. Batyrshin, Imre J. Rudas, Aleksandra Panova	On Generation of Digital Fuzzy Parametric Conjunctions.	Towards Intelligent Engineering and Information Technology	2009	DBLP DOI BibTeX RDF	Digital fuzzy conjunction, conjunctor, semicopula, finite scale, tnorm, commutativity
66	Wojciech A. Lorkiewicz, Radoslaw P. Katarzyniak	Recalling the Embodied Meaning of Modal Conjunctions in Artificial Cognitive Agents.	KES-AMSTA	2008	DBLP DOI BibTeX RDF	symbol interpretation, agent, Symbol grounding
66	Juan Javier González Barbosa, Rodolfo A. Pazos Rangel, Alexander F. Gelbukh, Grigori Sidorov, Héctor J. Fraire H., I. Cristina Cruz C.	Prepositions and Conjunctions in a Natural Language Interfaces to Databases.	ISPA Workshops	2007	DBLP DOI BibTeX RDF
48	Herman Akdag, Myriam Mokhtari	Approximative Conjunctions Processing by Multi-Valued Logic.	ISMVL	1996	DBLP DOI BibTeX RDF	conjunctions processing, neighbourhood degree, knowledge based systems, knowledge base, inference mechanisms, multivalued logic, production rule, multi-valued logic
48	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
43	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Generating Cut Conjunctions in Graphs and Related Problems.	Algorithmica	2008	DBLP DOI BibTeX RDF	Cut conjunction, Cut generation, Graph, Matroid, Multicut
43	Birte Glimm, Yevgeny Kazakov	Role Conjunctions in Expressive Description Logics.	LPAR	2008	DBLP DOI BibTeX RDF
43	Ritesh Agarwal, T. V. Prabhakar, Sugato Chakrabarty	"I Know What You Feel": Analyzing the Role of Conjunctions in Automatic Sentiment Analysis.	GoTAL	2008	DBLP DOI BibTeX RDF	Machine Learning, Support Vector Machines, Natural Language Processing, Sentiment Analysis, Linguistic Analysis
43	Radoslaw P. Katarzyniak	Some Properties of Grounding Modal Conjunctions in Artificial Cognitive Agents.	KES (2)	2005	DBLP DOI BibTeX RDF
38	Walter Oberschelp, Alexander Hornung, Horst Samulowitz	Visualization of eclipses and planetary conjunction events. The interplay between model coherence, scaling and animation.	Vis. Comput.	2001	DBLP DOI BibTeX RDF	Animation of celestial conjunctions, Object oriented motion simulation, Illumination by bright sources, Weber-Fechner-perception, Solar eclipse
34	Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, Srihari Venkatesan, Jason Y. Zien	Efficiently evaluating complex boolean expressions.	SIGMOD Conference	2010	DBLP DOI BibTeX RDF	dewey, interval, boolean expressions, pub/sub
34	Roni Khardon, Rocco A. Servedio	Maximum Margin Algorithms with Boolean Kernels.	COLT	2003	DBLP DOI BibTeX RDF
34	Kyugon Cho, Stanley M. Dunn	Learning Shape Classes.	IEEE Trans. Pattern Anal. Mach. Intell.	1994	DBLP DOI BibTeX RDF	shape classes learning, local shape properties, property based learning, shape learning system, classification, pattern recognition, learning (artificial intelligence), occlusion, incremental learning, learning systems, hand gestures
34	Dietmar Seipel	An Efficient Computation of Extended Generalized Closed World Assumption by Support-for-Negation Sets.	LPAR	1994	DBLP DOI BibTeX RDF
32	Radoslaw P. Katarzyniak, Ngoc Thanh Nguyen 0001, Lakhmi C. Jain	A Model for Fuzzy Grounding of Modal Conjunctions in Artificial Cognitive Agents.	KES-AMSTA	2008	DBLP DOI BibTeX RDF
32	Robert Dale, Pawel P. Mazur	Handling Conjunctions in Named Entities.	CICLing	2007	DBLP DOI BibTeX RDF
32	Yannis Tzitzikas, Anastasia Analyti	Mining the meaningful term conjunctions from materialised faceted taxonomies: algorithms and complexity.	Knowl. Inf. Syst.	2006	DBLP DOI BibTeX RDF	Knowledge extraction and reuse, Materialised faceted taxonomies, Algorithms, Complexity
32	Marc Meister, Khalil Djelloul, Thom W. Frühwirth	Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees.	CSCLP	2006	DBLP DOI BibTeX RDF
32	Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino	Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs.	ISAAC	2005	DBLP DOI BibTeX RDF
32	Abdusalam F. A. Nwesri, Seyed M. M. Tahaghoghi, Falk Scholer	Stemming Arabic Conjunctions and Prepositions.	SPIRE	2005	DBLP DOI BibTeX RDF
32	Juan Luis Esteban, Nicola Galesi, Jochen Messner	On the Complexity of Resolution with Bounded Conjunctions.	ICALP	2002	DBLP DOI BibTeX RDF
32	Jan Johannsen, N. S. Narayanaswamy	An Optimal Lower Bound for Resolution with 2-Conjunctions.	MFCS	2002	DBLP DOI BibTeX RDF
32	George Katsirelos, Fahiem Bacchus	GAC on Conjunctions of Constraints.	CP	2001	DBLP DOI BibTeX RDF
32	Gösta Grahne, Nicolas Spyratos, Daniel Stamate	Semantics and Containment with Internal and External Conjunctions.	ICDT	1997	DBLP DOI BibTeX RDF
27	Neil C. Rowe, Amr Zaky	Load Balancing of Parallelized Information Filters.	IEEE Trans. Knowl. Data Eng.	2002	DBLP DOI BibTeX RDF	optimality and Monte Carlo methods, information retrieval, load balancing, information filtering, data parallelism, conjunctions
27	Patrick Bosc	On the primitivity of the division of fuzzy relations.	SAC	1997	DBLP DOI BibTeX RDF	fuzzy conjunctions, relational databases, SQL, SQL, division, flexible queries, fuzzy implications
27	Donald B. McIntyre	The Role of Composition in Computer Programming.	APL	1995	DBLP DOI BibTeX RDF	Iverson, adverbs, composite verbs, executable mathematical notation, function composition, gerunds, hooks, APL, APL, trains, geometry, J, J, conjunctions, forks
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
22	Annamaria Bria, Wolfgang Faber 0001, Nicola Leone	nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver.	LPNMR	2009	DBLP DOI BibTeX RDF
22	Vincent Aravantinos, Ricardo Caferra, Nicolas Peltier	A Schemata Calculus for Propositional Logic.	TABLEAUX	2009	DBLP DOI BibTeX RDF
22	Dimitrios I. Diochnos, György Turán	On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance.	SAGA	2009	DBLP DOI BibTeX RDF	learning, evolution
22	Chedy Raïssi, Toon Calders, Pascal Poncelet	Mining Conjunctive Sequential Patterns.	ECML/PKDD (1)	2008	DBLP DOI BibTeX RDF
22	Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Frühwirth	Toward a first-order extension of Prolog's unification using CHR: a CHR first-order constraint solver over finite or infinite trees.	SAC	2007	DBLP DOI BibTeX RDF	CHR (Constraint Handling Rules), first-order constraints solving, theory of finite or infinite trees, Prolog, unification
22	Dana Glasner, Rocco A. Servedio	Distribution-Free Testing Lower Bounds for Basic Boolean Functions.	APPROX-RANDOM	2007	DBLP DOI BibTeX RDF
22	Tim Menzies, Ying Hu	Just enough learning (of association rules): the TAR2 "Treatment" learner.	Artif. Intell. Rev.	2006	DBLP DOI BibTeX RDF	TAR2, Treatment learning, Contrast set learning
22	Willem Jan van Hoeve, Jean-Charles Régin	Open Constraints in a Closed World.	CPAIOR	2006	DBLP DOI BibTeX RDF
22	Walid Bagga, Refik Molva, Stefano Crosta	Policy-based encryption schemes from bilinear pairings.	AsiaCCS	2006	DBLP DOI BibTeX RDF
22	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
22	Jean-Charles Régin	Combination of Among and Cardinality Constraints.	CPAIOR	2005	DBLP DOI BibTeX RDF
22	Franz Baader, Baris Sertkaya	Applying Formal Concept Analysis to Description Logics.	ICFCA	2004	DBLP DOI BibTeX RDF
22	Gustav Hast	Approximating Max kCSP Using Random Restrictions.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
22	Sumit Gulwani, George C. Necula	A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols.	CADE	2003	DBLP DOI BibTeX RDF
22	Yannis Tzitzikas, Nicolas Spyratos, Panos Constantopoulos, Anastasia Analyti	Extended Faceted Taxonomies for Web Catalogs.	WISE	2002	DBLP DOI BibTeX RDF
22	Ken Sadohara	On a Capacity Control Using Boolean Kernels for the Learning of Boolean Functions.	ICDM	2002	DBLP DOI BibTeX RDF
22	Yannis Tzitzikas, Nicolas Spyratos, Panos Constantopoulos, Anastasia Analyti	Extended Faceted Ontologies.	CAiSE	2002	DBLP DOI BibTeX RDF
22	Roberto Giacobazzi, Francesco Ranzato	States vs. Traces in Model Checking by Abstract Interpretation.	SAS	2002	DBLP DOI BibTeX RDF
22	Albert Atserias, Maria Luisa Bonet, Juan Luis Esteban	Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution.	ICALP	2001	DBLP DOI BibTeX RDF
22	Ken Sadohara	Learning of Boolean Functions Using Support Vector Machines.	ALT	2001	DBLP DOI BibTeX RDF
22	Reinhard Pichler	Extending Decidable Clause Classes via Constraints.	FTP (LNCS Selection)	1998	DBLP DOI BibTeX RDF
22	Elvira Albert, María Alpuente, Moreno Falaschi, Pascual Julián Iranzo, Germán Vidal	Improving Control in Functional Logic Program Specialization.	SAS	1998	DBLP DOI BibTeX RDF
22	Phokion G. Kolaitis, Moshe Y. Vardi	Infinitary Logic for Computer Science.	ICALP	1992	DBLP DOI BibTeX RDF
22	William W. Cohen, Haym Hirsh	Learnability of Description Logics.	COLT	1992	DBLP DOI BibTeX RDF
22	Philippe Codognet	Equations, Disequations and Unsolvable Subsets (abstract).	ISSAC	1990	DBLP DOI BibTeX RDF
22	Katja Lenz, Ingo Wegener	The Conjunctive Complexity of Quadratic Boolean Functions.	CSL	1987	DBLP DOI BibTeX RDF
22	Jai Menon 0001, David K. Hsiao	Access Control Mechanism of a Database Computer (DBC).	Computer Architecture for Non-Numeric Processing	1980	DBLP DOI BibTeX RDF
21	Daniel Kristanto, Andrea Hildebrandt, Werner Sommer, Changsong Zhou	Cognitive abilities are associated with specific conjunctions of structural and functional neural subnetworks.	NeuroImage	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.	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	Zheng Zhang, Fangguo Zhang	New Obfuscation Scheme for Conjunctions.	Comput. J.	2023	DBLP DOI BibTeX RDF
21	Suphasiree Chantavarin, Emily Morgan, Fernanda Ferreira	Robust Processing Advantage for Binomial Phrases with Variant Conjunctions.	Cogn. Sci.	2022	DBLP DOI BibTeX RDF
21	Ashish Kumar, Rahul Saha, Mauro Conti, Gulshan Kumar, William J. Buchanan, Tai-Hoon Kim	A comprehensive survey of authentication methods in Internet-of-Things and its conjunctions.	J. Netw. Comput. Appl.	2022	DBLP DOI BibTeX RDF
21	Aitor R. Gómez, Rafael Wisniewski	Stochastic Safety in Space Conjunctions.	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	David Lobo, Víctor López-Marchante, Jesús Medina 0001	On the Effects of Conjunctions in the Solution Set of Multi-adjoint Fuzzy Relation Equations.	IPMU (1)	2022	DBLP DOI BibTeX RDF
21	Pantia-Marina Alchirch, Dimitrios I. Diochnos, Katia Papakonstantinopoulou	Evolving Monotone Conjunctions in Regimes Beyond Proved Convergence.	EuroGP	2022	DBLP DOI BibTeX RDF
21	Michal Siedlaczek, Antonio Mallia, Torsten Suel	Using Conjunctions for Faster Disjunctive Top-k Queries.	WSDM	2022	DBLP DOI BibTeX RDF
21	Dimitrios I. Diochnos	On the Evolvability of Monotone Conjunctions with an Evolutionary Mutation Mechanism.	J. Artif. Intell. Res.	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	J. Russell Carpenter, F. Landis Markley	Sequential Wald Test Employing a Constrained Filter Bank: Application to Spacecraft Conjunctions.	J. Optim. Theory Appl.	2021	DBLP DOI BibTeX RDF
21	Wei Bian	The Differences Between Jiùshì and Jiùsuàn as Conjunctions and Their Formation Mechanisms.	CLSW (1)	2021	DBLP DOI BibTeX RDF
21	Joachim Büschken, Greg M. Allenby	Improving Text Analysis Using Sentence Conjunctions and Punctuation.	Mark. Sci.	2020	DBLP DOI BibTeX RDF
21	Andrei Lissovoi, Pietro S. Oliveto	On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions.	J. Artif. Intell. Res.	2019	DBLP DOI 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	Steven D. Galbraith, Lukas Zobernig	Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems.	IACR Cryptol. ePrint Arch.	2019	DBLP BibTeX RDF
21	Maja Popovic, Sheila Castilho	Are ambiguous conjunctions problematic for machine translation?	RANLP	2019	DBLP DOI BibTeX RDF
21	Steven D. Galbraith, Lukas Zobernig	Obfuscated Fuzzy Hamming Distance and Conjunctions from Subset Product Problems.	TCC (1)	2019	DBLP DOI BibTeX RDF
21	Alexander Durgin, Brendan Juba	Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs.	ALT	2019	DBLP BibTeX RDF
21	Stephanie McIntyre, Alexander Borgida, David Toman 0001, Grant E. Weddell	On Limited Conjunctions and Partial Features in Parameter-Tractable Feature Logics.	AAAI	2019	DBLP DOI 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	James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry	New Techniques for Obfuscating Conjunctions.	EUROCRYPT (3)	2019	DBLP DOI BibTeX RDF
21	Alexander Durgin, Brendan Juba	Hardness of improper one-sided learning of conjunctions for all uniformly falsifiable CSPs.	Electron. Colloquium Comput. Complex.	2018	DBLP BibTeX RDF
21	James Bartusek, Tancrède Lepoint, Fermi Ma, Mark Zhandry	New Techniques for Obfuscating Conjunctions.	IACR Cryptol. ePrint Arch.	2018	DBLP BibTeX RDF
21	Giuseppe Sanfilippo	Lower and Upper Probability Bounds for Some Conjunctions of Two Conditional Events.	SUM	2018	DBLP DOI BibTeX RDF
21	Andrei Lissovoi, Pietro S. Oliveto	On the Time and Space Complexity of Genetic Programming for Evolving Boolean Conjunctions.	AAAI	2018	DBLP DOI BibTeX RDF
21	Stephanie McIntyre, Alexander Borgida, David Toman 0001, Grant E. Weddell	On Limited Conjunctions in Polynomial Feature Logics, with Applications in OBDA.	KR	2018	DBLP BibTeX RDF
21	Marcel Steinmetz, Jörg Hoffmann 0001	LP Heuristics over Conjunctions: Compilation, Convergence, Nogood Learning.	IJCAI	2018	DBLP DOI BibTeX RDF
21	Zvika Brakerski, Guy N. Rothblum	Obfuscating Conjunctions.	J. Cryptol.	2017	DBLP DOI BibTeX RDF
21	Sergei Obiedkov	Parameterized ceteris paribus preferences over atomic conjunctions under conservative semantics.	Theor. Comput. Sci.	2017	DBLP DOI BibTeX RDF
21	Víctor Dalmau	Conjunctions of Among Constraints.	CoRR	2017	DBLP BibTeX RDF
21	Igor Mel'cuk	Dependency Structure of Binary Conjunctions(of the IF..., THEN... Type).	DepLing	2017	DBLP BibTeX RDF
21	Dimitri Surinx, Jan Van den Bussche, Dirk Van Gucht	The primitivity of operators in the algebra of binary relations under conjunctions of containments.	LICS	2017	DBLP DOI BibTeX RDF
21	Víctor Dalmau	Conjunctions of Among Constraints.	CP	2017	DBLP DOI BibTeX RDF
21	Kyohei Atarashi, Satoshi Oyama, Masahito Kurihara, Kazune Furudo	A Deep Neural Network for Pairwise Classification: Enabling Feature Conjunctions and Ensuring Symmetry.	PAKDD (1)	2017	DBLP DOI BibTeX RDF
21	Maximilian Fickert, Jörg Hoffmann 0001	Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.	SOCS	2017	DBLP DOI BibTeX RDF
21	Jia-Fei Hong	Chinese Conjunctions in Second Language Learners' Written Texts.	CLSW	2017	DBLP DOI BibTeX RDF
21	Katrin Prikrylová, Vladislav Kubon, Katerina Veselovská	The Role of Conjunctions in Adjective Polarity Analysis in Czech.	Computación y Sistemas	2016	DBLP DOI BibTeX RDF
21	Peter Müller 0001, Malte Schwerhoff, Alexander J. Summers	Automatic Verification of Iterated Separating Conjunctions using Symbolic Execution.	CoRR	2016	DBLP 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
21	Peter Müller 0001, Malte Schwerhoff, Alexander J. Summers	Automatic Verification of Iterated Separating Conjunctions Using Symbolic Execution.	CAV (1)	2016	DBLP DOI BibTeX RDF
21	Xi Chen 0001, Jinyu Xie	Tight Bounds for the Distribution-Free Testing of Monotone Conjunctions.	SODA	2016	DBLP DOI BibTeX RDF