Search results for "Literals"

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