The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase strong equivalence (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1978-1997 (15) 2001-2004 (16) 2005-2006 (16) 2007-2009 (17) 2010-2013 (17) 2014-2019 (18)
Publication types (Num. hits)
article(29) inproceedings(69) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 24 occurrences of 19 keywords

Results
Found 99 publication records. Showing 99 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
77Thomas Eiter, Michael Fink 0001 Uniform Equivalence of Logic Programs under the Stable Model Semantics. Search on Bibsonomy ICLP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF uniform equivalence, strong equivalence, computational complexity, program optimization, stable models, answer set semantics
60Chiaki Sakama, Katsumi Inoue Inductive Equivalence of Logic Programs. Search on Bibsonomy ILP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
55Ka-Shu Wong A Stronger Notion of Equivalence for Logic Programs. Search on Bibsonomy ICLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
54Katsumi Inoue, Chiaki Sakama Equivalence of Logic Programs Under Updates. Search on Bibsonomy JELIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
53Stefan Woltran Characterizations for Relativized Notions of Equivalence in Answer Set Programming. Search on Bibsonomy JELIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
49Hudson Turner Strong Equivalence for Causal Theories. Search on Bibsonomy LPNMR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
45Jörg Pührer, Hans Tompits Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. Search on Bibsonomy LPNMR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
44Hudson Turner Strong Equivalence for Logic Programs and Default Theories (Made Easy). Search on Bibsonomy LPNMR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
37Miklós Bartha Strong Retiming Equivalence of Synchronous Schemes. Search on Bibsonomy CIAA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Wolfgang Faber 0001, Kathrin Konczak Strong order equivalence. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 68T27, 68T30, 68T15
35Yin Chen, Fangzhen Lin, Lei Li SELP - A System for Studying Strong Equivalence Between Logic Programs. Search on Bibsonomy LPNMR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Thomas Eiter, Wolfgang Faber 0001, Patrick Traxler Testing Strong Equivalence of Datalog Programs - Implementation and Examples. Search on Bibsonomy LPNMR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
35Christos Nomikos, Panos Rondogiannis, William W. Wadge A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics. Search on Bibsonomy ICLP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
33Jörg Pührer, Hans Tompits, Stefan Woltran Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. Search on Bibsonomy ICLP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
32Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal Strongly Equivalent Temporal Logic Programs. Search on Bibsonomy JELIA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
26Yuliya Lierler Strong Equivalence and Program's Structure in Arguing Essential Equivalence between Logic Programs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
26Yuliya Lierler Strong Equivalence and Program's Structure in Arguing Essential Equivalence Between First-Order Logic Programs. Search on Bibsonomy PADL The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
26Vladimir Lifschitz, David Pearce 0001, Agustín Valverde A Characterization of Strong Equivalence for Logic Programs with Variables. Search on Bibsonomy LPNMR The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
26Paolo Ferraris On Modular Translations and Strong Equivalence. Search on Bibsonomy LPNMR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
25Youngsik Kim, Nazanin Mansouri Automated formal verification of scheduling with speculative code motions. Search on Bibsonomy ACM Great Lakes Symposium on VLSI The full citation details ... 2008 DBLP  DOI  BibTeX  RDF formal verification, high level synthesis, automated theorem-proving, speculation
24James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran Merging Logic Programs under Answer Set Semantics. Search on Bibsonomy ICLP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF strong equivalence, answer set programming, belief merging
24Thomas Eiter, Michael Fink 0001, Stefan Woltran Semantical characterizations and complexity of equivalences in answer set programming. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF strong equivalence, uniform equivalence, computational complexity, program optimization, stable models, Answer set semantics
23Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. Search on Bibsonomy INAP/WLP The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
23Vladimir Lifschitz, David Pearce 0001, Agustín Valverde Strongly equivalent logic programs. Search on Bibsonomy ACM Trans. Comput. Log. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF logic programming, stable models, answer sets
23Flemming Nielson Program Transformations in a Denotational Setting. Search on Bibsonomy ACM Trans. Program. Lang. Syst. The full citation details ... 1985 DBLP  DOI  BibTeX  RDF
19Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini Representing and Reasoning on SGML Documents. Search on Bibsonomy ISMIS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
19Bengt Jonsson, Joachim Parrow Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs. Search on Bibsonomy STACS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
18Mauricio Osorio 0001, Juan Antonio Navarro Pérez, José Arrazola Equivalence in Answer Set Programming. Search on Bibsonomy LOPSTR The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
18Gian Luigi Ferrari, Ugo Montanari, Paola Quaglia The Weak Late pi-Calculus Semantics as Observation Equivalence. Search on Bibsonomy CONCUR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
17Man Luo Strong equivalence for LPMLN programs. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
17Vladimir Lifschitz, Patrick Lühne, Torsten Schaub Verifying Strong Equivalence of Programs in the Input Language of gringo. Search on Bibsonomy LPNMR The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
17Tobias Geibinger, Hans Tompits Characterising Relativised Strong Equivalence with Projection for Non-ground Answer-Set Programs. Search on Bibsonomy JELIA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
17Wolfgang Faber 0001, Michael Morak, Stefan Woltran Strong Equivalence for Epistemic Logic Programs Made Easy. Search on Bibsonomy AAAI The full citation details ... 2019 DBLP  BibTeX  RDF
17Wolfgang Faber 0001, Michael Morak, Stefan Woltran Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version). Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
17Ringo Baumann, Hannes Strass An Abstract Logical Approach to Characterizing Strong Equivalence in Logic-based Knowledge Representation Formalisms. Search on Bibsonomy KR The full citation details ... 2016 DBLP  BibTeX  RDF
17Juan Carlos Nieves, Helena Lindgren Possibilistic nested logic programs and strong equivalence. Search on Bibsonomy Int. J. Approx. Reasoning The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
17Dimitrios Milios, Stephen Gilmore Component aggregation for PEPA models: An approach based on approximate strong equivalence. Search on Bibsonomy Perform. Eval. The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
17Amelia Harrison, Vladimir Lifschitz, David Pearce 0001, Agustín Valverde Infinitary Equilibrium Logic and Strong Equivalence. Search on Bibsonomy LPNMR The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
17Ulrich Bauer, Elizabeth Munch, Yusu Wang Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
17Ulrich Bauer, Elizabeth Munch, Yusu Wang Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
17James P. Delgrande, Kewen Wang An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
17Stephen P. Jordan Strong equivalence of reversible circuits is coNP-complete. Search on Bibsonomy Quantum Information & Computation The full citation details ... 2014 DBLP  BibTeX  RDF
17Zohir Bouzid, Eli Gafni, Petr Kuznetsov Strong Equivalence Relations for Iterated Models. Search on Bibsonomy OPODIS The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
17Matthias Knorr, José Júlio Alferes Preserving Strong Equivalence while Forgetting. Search on Bibsonomy JELIA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
17Pedro Cabalar, Martín Diéguez Strong Equivalence of Non-Monotonic Temporal Theories. Search on Bibsonomy KR The full citation details ... 2014 DBLP  BibTeX  RDF
17Wolfgang Faber 0001, Miroslaw Truszczynski, Stefan Woltran Strong Equivalence of Qualitative Optimization Problems. Search on Bibsonomy J. Artif. Intell. Res. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
17Stephen P. Jordan Strong equivalence of reversible circuits is coNP-complete. Search on Bibsonomy CoRR The full citation details ... 2013 DBLP  BibTeX  RDF
17Amelia Harrison The Semantics of Gringo and Proving Strong Equivalence. Search on Bibsonomy TPLP The full citation details ... 2013 DBLP  BibTeX  RDF
17Wolfgang Faber 0001, Miroslaw Truszczynski, Stefan Woltran Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. Search on Bibsonomy AAAI The full citation details ... 2013 DBLP  BibTeX  RDF
17Stefania Costantini, Andrea Formisano, David Pearce 0001 Strong Equivalence of RASP Programs. Search on Bibsonomy Correct Reasoning The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
17Tomi Janhunen, Ilkka Niemelä Applying Visible Strong Equivalence in Answer-Set Program Transformations. Search on Bibsonomy Correct Reasoning The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
17Wolfgang Faber 0001, Miroslaw Truszczynski, Stefan Woltran Strong Equivalence of Qualitative Optimization Problems. Search on Bibsonomy KR The full citation details ... 2012 DBLP  BibTeX  RDF
17Yisong Wang, Yan Zhang 0003, Yi Zhou, Mingyi Zhang Forgetting in Logic Programs under Strong Equivalence. Search on Bibsonomy KR The full citation details ... 2012 DBLP  BibTeX  RDF
17Emilia Oikarinen, Stefan Woltran Characterizing strong equivalence for argumentation frameworks. Search on Bibsonomy Artif. Intell. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
17Wolfgang Faber 0001, Miroslaw Truszczynski, Stefan Woltran Strong Equivalence of Qualitative Optimization Problems Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
17Sebastian Danicic, Robert M. Hierons, Michael R. Laurence Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas. Search on Bibsonomy J. Log. Algebr. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
17Sarah Alice Gaggl, Stefan Woltran Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. Search on Bibsonomy ECSQARU The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
17Johannes Oetsch, Hans Tompits Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence. Search on Bibsonomy LPNMR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
17Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You Strong Equivalence of Logic Programs with Abstract Constraint Atoms. Search on Bibsonomy LPNMR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
17Alexander Bochman, Vladimir Lifschitz Yet Another Characterization of Strong Equivalence. Search on Bibsonomy ICLP (Technical Communications) The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
17Stefan Woltran Strong Equivalence in Argumentation. Search on Bibsonomy CLIMA The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
17Emilia Oikarinen, Stefan Woltran Characterizing Strong Equivalence for Argumentation Frameworks. Search on Bibsonomy KR The full citation details ... 2010 DBLP  BibTeX  RDF
17Christos Nomikos, Panos Rondogiannis, William W. Wadge Strong equivalence of logic programs under the infinite-valued semantics. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
17Wolfgang Faber 0001, Hans Tompits, Stefan Woltran Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. Search on Bibsonomy KR The full citation details ... 2008 DBLP  BibTeX  RDF
17Joohyung Lee, Ravi Palla Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs. Search on Bibsonomy CENT The full citation details ... 2007 DBLP  BibTeX  RDF
17Catalin Zara Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order. Search on Bibsonomy Electr. J. Comb. The full citation details ... 2006 DBLP  BibTeX  RDF
17Mirek Truszczynski Strong Equivalence of Nonmonotonic Theories -- an Algebraic Approach. Search on Bibsonomy ISAIM The full citation details ... 2006 DBLP  BibTeX  RDF
17Tommaso Toffoli Thermodynamics of used punched tape: A weak and a strong equivalence principle Search on Bibsonomy CoRR The full citation details ... 2005 DBLP  BibTeX  RDF
17Yin Chen, Fangzhen Lin, Lei Li SELP - A System for Studying Strong Equivalence between Logic Programs. Search on Bibsonomy Answer Set Programming The full citation details ... 2005 DBLP  BibTeX  RDF
17Wolfgang Faber 0001, Kathrin Konczak Strong Equivalence for Logic Programs with Preferences. Search on Bibsonomy IJCAI The full citation details ... 2005 DBLP  BibTeX  RDF
17Thomas Eiter, Michael Fink 0001, Hans Tompits, Stefan Woltran Simplifying Logic Programs Under Uniform and Strong Equivalence. Search on Bibsonomy LPNMR The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
17Hudson Turner Strong Equivalence Made Easy: Nested Expressions and Weight Constraints Search on Bibsonomy CoRR The full citation details ... 2003 DBLP  BibTeX  RDF
17Hudson Turner Strong equivalence made easy: nested expressions and weight constraints. Search on Bibsonomy TPLP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
17Pedro Cabalar Alternative Characterizations for Strong Equivalence of Logic Programs Search on Bibsonomy CoRR The full citation details ... 2002 DBLP  BibTeX  RDF
17Pedro Cabalar Alternative characterizations for strong equivalence of logic programs. Search on Bibsonomy NMR The full citation details ... 2002 DBLP  BibTeX  RDF
17Pedro Cabalar A Three-Valued Characterization for Strong Equivalence of Logic Programs. Search on Bibsonomy AAAI/IAAI The full citation details ... 2002 DBLP  BibTeX  RDF
17Fangzhen Lin Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. Search on Bibsonomy KR The full citation details ... 2002 DBLP  BibTeX  RDF
17Naoki Yoshinaga 0001, Yusuke Miyao, Jun'ichi Tsujii A Formal Proof of Strong Equivalence for a Grammar Conversion from LTAG to HPSG-style. Search on Bibsonomy TAG+ The full citation details ... 2002 DBLP  BibTeX  RDF
17Gabriel Istrate The Strong Equivalence of ET0L Grammars. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
17Maciej Kandulski Strong Equivalence of Generalized Ajdukiewicz and Lambek Grammars. Search on Bibsonomy LACL The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
17Gabriel Istrate The Strong Equivalence of ETOL Grammars. Search on Bibsonomy Developments in Language Theory The full citation details ... 1993 DBLP  BibTeX  RDF
17Carol Lynn Foster Algorithms, abstraction and implementation : a massively multilevel theory of strong equivalence of complex systems. Search on Bibsonomy 1991   RDF
17Douglas R. Troeger An Axiomatization of D-scheme Strong Equivalence. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1983 DBLP  DOI  BibTeX  RDF
17Marc H. Graham, Alberto O. Mendelzon Strong Equivalence of Relational Wxpressions Under Dependencies. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1982 DBLP  DOI  BibTeX  RDF
17Charles R. Baker Mutual Information, Strong Equivalence, and Signal Sample Path Properties for Gaussian Processes Search on Bibsonomy Information and Control The full citation details ... 1979 DBLP  DOI  BibTeX  RDF
17Calvin C. Elgot A representative strong equivalence class for accessible flowchart schemes. Search on Bibsonomy Mathematical Studies of Information Processing The full citation details ... 1978 DBLP  DOI  BibTeX  RDF
14Agustín Valverde tabeql: A Tableau Based Suite for Equilibrium Logic. Search on Bibsonomy JELIA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
14João Falcão e Cunha Compositionality and Omniscience in Situation Semantics. Search on Bibsonomy EAIA The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
12Katsumi Inoue, Chiaki Sakama Generality Relations in Answer Set Programming. Search on Bibsonomy ICLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
12Sergei P. Odintsov, David Pearce 0001 Routley Semantics for Answer Sets. Search on Bibsonomy LPNMR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
12Richard Gerber, Insup Lee CCSR: A Calculus for Communicating Shared Resources. Search on Bibsonomy CONCUR The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
9Pedro Cabalar, Sergei P. Odintsov, David Pearce 0001 Well-Founded and Partial Stable Semantics Logical Aspects. Search on Bibsonomy CSR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF partial stable models, equilibrium logic, partial equilibrium logic, well-founded semantics
9Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández Rewriting and Call-Time Choice: The HO Case. Search on Bibsonomy FLOPS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
9David Pearce 0001, Agustín Valverde Quantified Equilibrium Logic and Foundations for Answer Set Programs. Search on Bibsonomy ICLP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
9Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing. Search on Bibsonomy DCC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Burrows-Wheeler, Lower Bounds, Pattern Matching, Range Searching
9Thomas Eiter, Wolfgang Faber 0001, Michael Fink 0001, Stefan Woltran Complexity results for answer set programming with bounded predicate arities and implications. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 68N17, 68Q17
9Pedro Cabalar, Sergei P. Odintsov, David Pearce 0001, Agustín Valverde Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic. Search on Bibsonomy ICLP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
9Kewen Wang, Yan Zhang Nested Epistemic Logic Programs. Search on Bibsonomy LPNMR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
9William L. Scherlis Program Improvement by Internal Specialization. Search on Bibsonomy POPL The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #99 of 99 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license