The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1967-1986 (17) 1987-1989 (18) 1990-1991 (24) 1992 (15) 1993-1994 (21) 1995-1996 (18) 1997-1998 (21) 1999-2000 (33) 2001 (18) 2002 (26) 2003 (21) 2004 (37) 2005 (36) 2006 (23) 2007 (28) 2008 (19) 2009 (24) 2010-2015 (16) 2016-2019 (22) 2020-2022 (18) 2023 (7)
Publication types (Num. hits)
article(95) incollection(1) inproceedings(365) phdthesis(1)
Venues (Conferences, Journals, ...)
CADE(23) JELIA(19) ISMVL(17) LPAR(15) CoRR(12) ICLP(12) SAT(12) ILP(11) ISMIS(10) CSL(9) IEEE Trans. Comput. Aided Des....(9) LPNMR(8) Ann. Math. Artif. Intell.(7) ECML(7) J. ACM(7) MFCS(7) More (+10 of total 203)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 278 occurrences of 215 keywords

Results
Found 462 publication records. Showing 462 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
79David Billington Proving Quantified Literals in Defeasible Logic. Search on Bibsonomy Australian Joint Conference on Artificial Intelligence The full citation details ... 1997 DBLP  DOI  BibTeX  RDF Quantified literals, Nonmonotonic reasoning, Defeasible logic
72Yutaka Hata, Naotake Kamiura, Kazuharu Yamato On Input Permutation Technique for Multiple-Valued Logic Synthesis. Search on Bibsonomy ISMVL The full citation details ... 1995 DBLP  DOI  BibTeX  RDF input permutation technique, multiple-valued logic synthesis, multiple valued sum of products expressions, TSUM, minimal sum of products expressions, permuted logic values, randomly generated functions, input permutation, output permutation, minimization times, window literals, sum of products expressions, set literals, logic design, set theory, multivalued logic
59T. Utsumi, Naotake Kamiura, Yutaka Hata, Kazuharu Yamato Multiple-Valued Programmable Logic Arrays with Universal Literals. Search on Bibsonomy ISMVL The full citation details ... 1997 DBLP  DOI  BibTeX  RDF universal literals, multiple-valued programmable logic, universal literal generators, operator structures, programmable logic arrays, programmable logic arrays
53Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir Guarded Open Answer Set Programming with Generalized Literals. Search on Bibsonomy FoIKS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
51Christoph Wernhard Literal Projection for First-Order Logic. Search on Bibsonomy JELIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
51Andrew G. D. Rowley Watching Clauses in Quantified Boolean Formulae. Search on Bibsonomy CP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
51Wolfgang Faber 0001, Nicola Leone, Gerald Pfeifer Optimizing the Computation of Heuristics for Answer Set Programming Systems. Search on Bibsonomy LPNMR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
51Daya Ram Gaur, Ramesh Krishnamurti Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colorability. Search on Bibsonomy ISAAC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF hypergraph 2-colorability, set splitting, maxnaesp, approximation algorithms, max-cut
51Mark E. Stickel Rationale and Methods for Abductice Reasoning in Natural-Language Interpretation. Search on Bibsonomy Natural Language and Logic The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
43Ian P. Gent, Christopher Jefferson, Ian Miguel Watched Literals for Constraint Propagation in Minion. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
43Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella Monotone Literals and Learning in QBF Reasoning. Search on Bibsonomy CP The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir Preferential Reasoning on a Web of Trust. Search on Bibsonomy ISWC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
41Danila A. Sinopalnikov Satisfiability Threshold of the Skewed Random k-SAT. Search on Bibsonomy SAT (Selected Papers The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
41Hai-Feng Guo, C. R. Ramakrishnan 0001, I. V. Ramakrishnan Speculative Beats Conservative Justification. Search on Bibsonomy ICLP The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
41Venkatesan Guruswami Inapproximability results for set splitting and satisfiability problems with no mixed clauses. Search on Bibsonomy APPROX The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
41Geoff Sutcliffe A Comparison of Mechanisms for Avoiding Repetition of Subdeductions in Chain Formal Linear Deduction Systems. Search on Bibsonomy LPAR The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
36Chao-Chih Yang, Jennifer Jau-Yin Chen, H. Lewis Chau Algorithms for Constructing Minimal Deduction Graphs. Search on Bibsonomy IEEE Trans. Software Eng. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF MDG construction algorithms, Hern clauses, minimal deduction graphs, Horn clause logic, DG, Horn formulas, positive literals, rule instances, tree space, logic programming, graphs, expert systems, inference mechanisms, transitivity, backtracking, inference rules, reflexivity, arcs, sink, subtrees, HF
33Jan Struyf, Hendrik Blockeel Query Optimization in Inductive Logic Programming by Reordering Literals. Search on Bibsonomy ILP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
33Juan J. Rodríguez Diez, Carlos Alonso González Applying Boosting to Similarity Literals for Time Series Classification. Search on Bibsonomy Multiple Classifier Systems The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
33Takahiro Hozumi, Osamu Kakusho, Yutaka Hata The Output Permutation for the Multiple-Valued Logic Minimization with Universal Literals. Search on Bibsonomy ISMVL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF universal literal, output permutation, current-mode CMOS circuits, logic synthesis, cost reduction
33Noboru Takagi, Akimitsu Hon-nami, Kyoichi Nakashima Logical Model for Representing Uncertain Statuses of Multiple-Valued Logic Systems Realized by Min, Max and Literals. Search on Bibsonomy ISMVL The full citation details ... 1999 DBLP  DOI  BibTeX  RDF set logic, set-valued functions, uncertainty
33Stefano Aguzzoli A note on the representation of McNaughton lines by basic literals. Search on Bibsonomy Soft Comput. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
30Richard Frank, Martin Ester, Arno J. Knobbe A multi-relational approach to spatial classification. Search on Bibsonomy KDD The full citation details ... 2009 DBLP  DOI  BibTeX  RDF spatial classification, parallelization, aggregation, spatial data mining
30Kiyokuni Kawachiya, Kazunori Ogata, Tamiya Onodera Analysis and reduction of memory inefficiencies in Java strings. Search on Bibsonomy OOPSLA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF footprint analysis and reduction, java, garbage collection, memory management, string
30Ignacio D. Viglizzo, Fernando A. Tohmé, Guillermo Ricardo Simari An Alternative Foundation for DeLP: Defeating Relations and Truth Values. Search on Bibsonomy FoIKS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
30Jeremy J. Carroll, Addison Phillips Multilingual RDF and OWL. Search on Bibsonomy ESWC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Venkatesan Guruswami, Luca Trevisan The Complexity of Making Unique Choices: Approximating 1-in- k SAT. Search on Bibsonomy APPROX-RANDOM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
30Sumit Gulwani, George C. Necula A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols. Search on Bibsonomy CADE The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
30Alvaro del Val Simplifying Binary Propositional Theories into Connected Components Twice as Fast. Search on Bibsonomy LPAR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
30Dietmar Seipel Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases. Search on Bibsonomy FoIKS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
30Els Laenens, Dirk Vermeir, Carlo Zaniolo Logic Programming Semantics Made Easy. Search on Bibsonomy ICALP The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
30Georg Gottlob, Alexander Leitsch On the Efficiency of Subsumption Algorithms Search on Bibsonomy J. ACM The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
26Hafiz Md. Hasan Babu, Md. Rafiqul Islam 0001, Amin Ahsan Ali, Mohammad Musa Salehin Akon A Technique for Logic Design of Voltage-Mode Pass Transistor Based Multi-Valued Multiple-Output Logic Circuits. Search on Bibsonomy ISMVL The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Multi-valued logic (MVL), TMOS logic circuits, Support set, Residual, Literals
26Mostafa I. H. Abd-El-Barr, Zvonko G. Vranesic, Safwat G. Zaky Algorithmic Synthesis of MVL Functions for CCD Implementation. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1991 DBLP  DOI  BibTeX  RDF algorithmic synthesis, CCD implementation, sum of products, logic design, many-valued logics, logic circuits, charge-coupled devices, MVL functions, literals
26Dana Angluin, Michael Frazier, Leonard Pitt Learning Conjunctions of Horn Clauses (Extended Abstract) Search on Bibsonomy FOCS The full citation details ... 1990 DBLP  DOI  BibTeX  RDF clauses, Horn clause conjunctions, Horn sentence, disjunction of literals, negated variable, unknown formula, learning algorithm, Boolean formulas, polynomial time complexity, membership queries, equivalence queries
26Sreejit Chakravarty, Harry B. Hunt III, S. S. Ravi, Daniel J. Rosenkrantz The Complexity of Generating Minimum Test Sets for PLA's and Monotone Combinational Circuits. Search on Bibsonomy IEEE Trans. Computers The full citation details ... 1989 DBLP  DOI  BibTeX  RDF minimum test sets, monotone combinational circuits, minimum complete test set, monotone PLAs, computational complexity, complexity, logic testing, NP-complete, logic arrays, combinatorial circuits, literals
23Caglar Demir, Michel Wiebesiek, Renzhong Lu, Axel-Cyrille Ngonga Ngomo, Stefan Heindorf LitCQD: Multi-Hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Patryk Preisner, Heiko Paulheim Universal Preprocessing Operators for Embedding Knowledge Graphs with Literals. Search on Bibsonomy CoRR The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Caglar Demir, Michel Wiebesiek, Renzhong Lu, Axel-Cyrille Ngonga Ngomo, Stefan Heindorf LitCQD: Multi-hop Reasoning in Incomplete Knowledge Graphs with Numeric Literals. Search on Bibsonomy ECML/PKDD (3) The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Sascha Meckler, Andreas Harth SPARQL_edit: Editing RDF Literals in Knowledge Graphs via View-Update Translations. Search on Bibsonomy ISWC The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Farshad Bakhshandegan Moghaddam, Jens Lehmann 0001, Hajira Jabeen Anomaly Detection for Numerical Literals in Knowledge Graphs: A Short Review of Approaches. Search on Bibsonomy AIKE The full citation details ... 2023 DBLP  DOI  BibTeX  RDF
23Patryk Preisner, Heiko Paulheim Universal Preprocessing Operators for Embedding Knowledge Graphs with Literals. Search on Bibsonomy DL4KG@ISWC The full citation details ... 2023 DBLP  BibTeX  RDF
23Genet Asefa Gesese Leveraging literals for knowledge graph embeddings. Search on Bibsonomy 2023   RDF
23Cristian Santini, Genet Asefa Gesese, Silvio Peroni, Aldo Gangemi, Harald Sack, Mehwish Alam A Knowledge Graph Embeddings based Approach for Author Name Disambiguation using Literals. Search on Bibsonomy CoRR The full citation details ... 2022 DBLP  BibTeX  RDF
23Cristian Santini, Genet Asefa Gesese, Silvio Peroni, Aldo Gangemi, Harald Sack, Mehwish Alam A knowledge graph embeddings based approach for author name disambiguation using literals. Search on Bibsonomy Scientometrics The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Nicolas Anquetil, Julien Delplanque, Stéphane Ducasse, Oleksandr Zaitsev, Christopher P. Fuhrman, Yann-Gaël Guéhéneuc What do developers consider magic literals? A smalltalk perspective. Search on Bibsonomy Inf. Softw. Technol. The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Christophe Debruyne Supporting Relational Database Joins for Generating Literals in R2RML. Search on Bibsonomy KGCW@ESWC The full citation details ... 2022 DBLP  BibTeX  RDF
23Zachary Hansen, Yuliya Lierler Semantics for Conditional Literals via the SM Operator. Search on Bibsonomy LPNMR The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Thanh Le 0001, Tuan Tran, Bac Le Embedding and Integrating Literals to the HypER Model for Link Prediction on Knowledge Graphs. Search on Bibsonomy ACIIDS (1) The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Adnan Darwiche, Pierre Marquis On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Extended Abstract). Search on Bibsonomy IJCAI The full citation details ... 2022 DBLP  DOI  BibTeX  RDF
23Genet Asefa Gesese, Russa Biswas, Mehwish Alam, Harald Sack A survey on knowledge graph embeddings with literals: Which model links better literal-ly? Search on Bibsonomy Semantic Web The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Trapti Sharma, Laxmi Kumre Design of unbalanced ternary counters using shifting literals based D-Flip-Flops in carbon nanotube technology. Search on Bibsonomy Comput. Electr. Eng. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Adnan Darwiche, Pierre Marquis On Quantifying Literals in Boolean Logic and its Applications to Explainable AI. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Adnan Darwiche, Pierre Marquis On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI. Search on Bibsonomy CoRR The full citation details ... 2021 DBLP  BibTeX  RDF
23Genet Asefa Gesese, Mehwish Alam, Harald Sack LiterallyWikidata - A Benchmark for Knowledge Graph Completion Using Literals. Search on Bibsonomy ISWC The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Nils Froleyks, Armin Biere Single Clause Assumption without Activation Literals to Speed-up IC3. Search on Bibsonomy FMCAD The full citation details ... 2021 DBLP  DOI  BibTeX  RDF
23Arvid Butting, Robert Reikermannobert, Katrin Hölldobler, Nico Jansen, Bernhard Rumpe, Andreas Wortmann 0001 A Library of Literals, Expressions, Types, and Statements for Compositional Language Design. Search on Bibsonomy J. Object Technol. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Trapti Sharma, Laxmi Kumre CNFET based design of unbalanced ternary circuits using efficient shifting literals. Search on Bibsonomy Microelectron. J. The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon On Irrelevant Literals in Pseudo-Boolean Constraint Learning. Search on Bibsonomy CoRR The full citation details ... 2020 DBLP  BibTeX  RDF
23Morgan Fine-Morris, Bryan Auslander, Hector Muñoz-Avila, Kalyan Moy Gupta Learning Actions with Symbolic Literals and Continuous Effects for a Waypoint Navigation Simulation. Search on Bibsonomy IntelliSys (1) The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Daniel Le Berre, Pierre Marquis, Stefan Mengel, Romain Wallon On Irrelevant Literals in Pseudo-Boolean Constraint Learning. Search on Bibsonomy IJCAI The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
23Mario Alviano, Carmine Dodaro Model Enumeration via Assumption Literals. Search on Bibsonomy Fundam. Informaticae The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Genet Asefa Gesese, Russa Biswas, Mehwish Alam, Harald Sack A Survey on Knowledge Graph Embeddings with Literals: Which model links better Literal-ly? Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
23Jiaoyan Chen, Ernesto Jiménez-Ruiz, Ian Horrocks 0001 Canonicalizing Knowledge Base Literals. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
23Ting Liu, Yang Xu, Xiulan Chen 命题逻辑中单元子句及其负文字和冗余子句 (Unit Clauses and Their Complementary Literals and Redundant Clauses in Propositional Logic). Search on Bibsonomy 计算机科学 The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Rohit Dureja, Jianwen Li, Geguang Pu, Moshe Y. Vardi, Kristin Y. Rozier Intersection and Rotation of Assumption Literals Boosts Bug-Finding. Search on Bibsonomy VSTTE The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Agustinus Kristiadi, Mohammad Asif Khan 0001, Denis Lukovnikov, Jens Lehmann 0001, Asja Fischer Incorporating Literals into Knowledge Graph Embeddings. Search on Bibsonomy ISWC (1) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Jiaoyan Chen, Ernesto Jiménez-Ruiz, Ian Horrocks 0001 Canonicalizing Knowledge Base Literals. Search on Bibsonomy ISWC (1) The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
23Genet Asefa Gesese, Russa Biswas, Harald Sack A Comprehensive Survey of Knowledge Graph Embeddings with Literals: Techniques and Applications. Search on Bibsonomy DL4KG@ESWC The full citation details ... 2019 DBLP  BibTeX  RDF
23Wouter Beek, Filip Ilievski, Jeremy Debattista, Stefan Schlobach, Jan Wielemaker Literally better: Analyzing and improving the quality of literals. Search on Bibsonomy Semantic Web The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Michael Cochez, Martina Garofalo, Jérôme Lenßen, Maria Angela Pellegrino A First Experiment on Including Text Literals in KGloVe. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
23Agustinus Kristiadi, Mohammad Asif Khan 0001, Denis Lukovnikov, Jens Lehmann 0001, Asja Fischer Incorporating Literals into Knowledge Graph Embeddings. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
23John Slaney, Bruno Woltzenlogel Paleo Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23John Slaney, Bruno Woltzenlogel Paleo Erratum to: Conflict Resolution: A First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning. Search on Bibsonomy J. Autom. Reason. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Michael Cochez, Martina Garofalo, Jérôme Lenßen, Maria Angela Pellegrino A First Experiment on Including Text Literals in KGloVe. Search on Bibsonomy Semdeep/NLIWoD@ISWC The full citation details ... 2018 DBLP  BibTeX  RDF
23Gustavo de Assis Costa, José Maria Parente de Oliveira Towards Exploring Literals to Enrich Data Linking in Knowledge Graphs. Search on Bibsonomy AIKE The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Mathias Fleury, Jasmin Christian Blanchette, Peter Lammich A verified SAT solver with watched literals using imperative HOL. Search on Bibsonomy CPP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
23Manolis Peponakis In the Name of the Name: RDF literals, ER Attributes and the Potential to Rethink the Structures and Visualizations of Catalogs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
23John Slaney, Bruno Woltzenlogel Paleo Conflict Resolution: a First-Order Resolution Calculus with Decision Literals and Conflict-Driven Clause Learning. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
23Alexey Melnikov 0001 IMAP4 Non-synchronizing Literals. Search on Bibsonomy RFC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Kalpa Gunaratna, Krishnaprasad Thirunarayan, Amit P. Sheth, Gong Cheng 0001 Gleaning Types for Literals in RDF Triples with Application to Entity Summarization. Search on Bibsonomy ESWC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Hendrik Blockeel Identifying Non-Redundant Literals in Clauses with Uniqueness Propagation. Search on Bibsonomy ILP (Short Papers) The full citation details ... 2016 DBLP  BibTeX  RDF
23Mario Alviano, Carmine Dodaro Answer Set Enumeration via Assumption Literals. Search on Bibsonomy AI*IA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
23Alexander Ivrii, Vadim Ryvchin, Ofer Strichman Mining Backbone Literals in Incremental SAT - A New Kind of Incremental Data. Search on Bibsonomy SAT The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Marijn Heule, Martina Seidl, Armin Biere Blocked Literals Are Universal. Search on Bibsonomy NFM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Florian Rabe 0001 Generic Literals. Search on Bibsonomy CICM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
23Matti Järvisalo, Janne H. Korhonen Conditional Lower Bounds for Failed Literals and Related Techniques. Search on Bibsonomy SAT The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Kazuhiro Ichikawa, Shigeru Chiba Composable user-defined operators that can express user-defined literals. Search on Bibsonomy MODULARITY The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
23Weisheng Li 0001, Jiao Du, Lifang Zhou Translation Algorithm for Negative Literals in Conformant Planning. Search on Bibsonomy J. Softw. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Yong Lai, Dayou Liu, Sheng-Sheng Wang 0001 Reduced ordered binary decision diagram with implied literals: a new knowledge compilation approach. Search on Bibsonomy Knowl. Inf. Syst. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Ian P. Gent Optimal Implementation of Watched Literals and More General Techniques. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Brian E. Carpenter, Stuart Cheshire, Robert M. Hinden Representing IPv6 Zone Identifiers in Address Literals and Uniform Resource Identifiers. Search on Bibsonomy RFC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Tobias Achterberg, Ashish Sabharwal, Horst Samulowitz Stronger Inference through Implied Literals from Conflicts and Knapsack Covers. Search on Bibsonomy CPAIOR The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
23Arie Matsliah, Ashish Sabharwal, Horst Samulowitz Augmenting Clause Learning with Implied Literals - (Poster Presentation). Search on Bibsonomy SAT The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
23Yong Lai, Dayou Liu, Sheng-Sheng Wang 0001 Reduced Ordered Binary Decision Diagram with Implied Literals: A New knowledge Compilation Approach Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
23Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc Tautologies over implication with negative literals. Search on Bibsonomy Math. Log. Q. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Eric Peterson Reified Literals: A Best Practice Candidate Design Pattern for Increased Expressivity in the Intelligence Community. Search on Bibsonomy STIDS The full citation details ... 2010 DBLP  BibTeX  RDF
23Uwe Bubeck, Hans Kleine Büning Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN. Search on Bibsonomy SAT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
23Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez On the satisfiability threshold of formulas with three literals per clause. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
23Lilyana Mihalkova, Matthew Richardson Speeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals. Search on Bibsonomy ILP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 462 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license