Search results for "strong equivalence"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Jörg Pührer, Hans Tompits	Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection.	LPNMR	2009	DBLP DOI BibTeX RDF
2	Vladimir Lifschitz, David Pearce, Agustín Valverde	A Characterization of Strong Equivalence for Logic Programs with Variables.	LPNMR	2007	DBLP DOI BibTeX RDF
2	Christos Nomikos, Panos Rondogiannis, William W. Wadge	A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics.	ICLP	2005	DBLP DOI BibTeX RDF
2	Yin Chen, Fangzhen Lin, Lei Li	SELP - A System for Studying Strong Equivalence Between Logic Programs.	LPNMR	2005	DBLP DOI BibTeX RDF
2	Paolo Ferraris	On Modular Translations and Strong Equivalence.	LPNMR	2005	DBLP DOI BibTeX RDF
2	Thomas Eiter, Wolfgang Faber, Patrick Traxler	Testing Strong Equivalence of Datalog Programs - Implementation and Examples.	LPNMR	2005	DBLP DOI BibTeX RDF
2	Hudson Turner	Strong Equivalence for Causal Theories.	LPNMR	2004	DBLP DOI BibTeX RDF
2	Thomas Eiter, Michael Fink	Uniform Equivalence of Logic Programs under the Stable Model Semantics.	ICLP	2003	DBLP DOI BibTeX RDF	uniform equivalence, strong equivalence, computational complexity, program optimization, stable models, answer set semantics
2	Hudson Turner	Strong Equivalence for Logic Programs and Default Theories (Made Easy).	LPNMR	2001	DBLP DOI BibTeX RDF
1	Sebastian Danicic, Robert M. Hierons, Michael R. Laurence	Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas.	J. Log. Algebr. Program.	2011	DBLP DOI BibTeX RDF
1	Wolfgang Faber, Miroslaw Truszczynski, Stefan Woltran	Strong Equivalence of Qualitative Optimization Problems	CoRR	2011	DBLP BibTeX RDF
1	Emilia Oikarinen, Stefan Woltran	Characterizing strong equivalence for argumentation frameworks.	Artif. Intell.	2011	DBLP DOI BibTeX RDF
1	Sarah Alice Gaggl, Stefan Woltran	Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets.	ECSQARU	2011	DBLP DOI BibTeX RDF
1	Alexander Bochman, Vladimir Lifschitz	Yet Another Characterization of Strong Equivalence.	ICLP (Technical Communications)	2011	DBLP DOI BibTeX RDF
1	Guohua Liu, Randy Goebel, Tomi Janhunen, Ilkka Niemelä, Jia-Huai You	Strong Equivalence of Logic Programs with Abstract Constraint Atoms.	LPNMR	2011	DBLP DOI BibTeX RDF
1	Johannes Oetsch, Hans Tompits	Gentzen-Type Refutation Systems for Three-Valued Logics with an Application to Disproving Strong Equivalence.	LPNMR	2011	DBLP DOI BibTeX RDF
1	Stefan Woltran	Strong Equivalence in Argumentation.	CLIMA	2010	DBLP DOI BibTeX RDF
1	Emilia Oikarinen, Stefan Woltran	Characterizing Strong Equivalence for Argumentation Frameworks.	KR	2010	DBLP BibTeX RDF
1	Christos Nomikos, Panos Rondogiannis, William W. Wadge	Strong equivalence of logic programs under the infinite-valued semantics.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
1	James P. Delgrande, Torsten Schaub, Hans Tompits, Stefan Woltran	Merging Logic Programs under Answer Set Semantics.	ICLP	2009	DBLP DOI BibTeX RDF	strong equivalence, answer set programming, belief merging
1	Pedro Cabalar, Sergei P. Odintsov, David Pearce	Well-Founded and Partial Stable Semantics Logical Aspects.	CSR	2009	DBLP DOI BibTeX RDF	partial stable models, equilibrium logic, partial equilibrium logic, well-founded semantics
1	Wolfgang Faber, Hans Tompits, Stefan Woltran	Notions of Strong Equivalence for Logic Programs with Ordered Disjunction.	KR	2008	DBLP BibTeX RDF
1	Youngsik Kim, Nazanin Mansouri	Automated formal verification of scheduling with speculative code motions.	ACM Great Lakes Symposium on VLSI	2008	DBLP DOI BibTeX RDF	formal verification, high level synthesis, automated theorem-proving, speculation
1	Yu-Feng Chien, Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter	Geometric Burrows-Wheeler Transform: Linking Range Searching and Text Indexing.	DCC	2008	DBLP DOI BibTeX RDF	Burrows-Wheeler, Lower Bounds, Pattern Matching, Range Searching
1	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	Rewriting and Call-Time Choice: The HO Case.	FLOPS	2008	DBLP DOI BibTeX RDF
1	David Pearce, Agustín Valverde	Quantified Equilibrium Logic and Foundations for Answer Set Programs.	ICLP	2008	DBLP DOI BibTeX RDF
1	Jörg Pührer, Hans Tompits, Stefan Woltran	Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence.	ICLP	2008	DBLP DOI BibTeX RDF
1	Felicidad Aguado, Pedro Cabalar, Gilberto Pérez, Concepción Vidal	Strongly Equivalent Temporal Logic Programs.	JELIA	2008	DBLP DOI BibTeX RDF
1	Joohyung Lee, Ravi Palla	Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs.	CENT	2007	DBLP BibTeX RDF
1	Thomas Eiter, Michael Fink, Stefan Woltran	Semantical characterizations and complexity of equivalences in answer set programming.	ACM Trans. Comput. Log.	2007	DBLP DOI BibTeX RDF	strong equivalence, uniform equivalence, computational complexity, program optimization, stable models, Answer set semantics
1	Ka-Shu Wong	A Stronger Notion of Equivalence for Logic Programs.	ICLP	2007	DBLP DOI BibTeX RDF
1	Johannes Oetsch, Martina Seidl, Hans Tompits, Stefan Woltran	Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT.	INAP/WLP	2007	DBLP DOI BibTeX RDF
1	Thomas Eiter, Wolfgang Faber, Michael Fink, Stefan Woltran	Complexity results for answer set programming with bounded predicate arities and implications.	Ann. Math. Artif. Intell.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68N17, 68Q17
1	Catalin Zara	Chains, Subwords, and Fillings: Strong Equivalence of Three Definitions of the Bruhat Order.	Electr. J. Comb.	2006	DBLP BibTeX RDF
1	Mirek Truszczynski	Strong Equivalence of Nonmonotonic Theories -- an Algebraic Approach.	ISAIM	2006	DBLP BibTeX RDF
1	Pedro Cabalar, Sergei P. Odintsov, David Pearce, Agustín Valverde	Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic.	ICLP	2006	DBLP DOI BibTeX RDF
1	Katsumi Inoue, Chiaki Sakama	Generality Relations in Answer Set Programming.	ICLP	2006	DBLP DOI BibTeX RDF
1	Wolfgang Faber, Kathrin Konczak	Strong order equivalence.	Ann. Math. Artif. Intell.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 68T27, 68T30, 68T15
1	Tommaso Toffoli	Thermodynamics of used punched tape: A weak and a strong equivalence principle	CoRR	2005	DBLP BibTeX RDF
1	Wolfgang Faber, Kathrin Konczak	Strong Equivalence for Logic Programs with Preferences.	IJCAI	2005	DBLP BibTeX RDF
1	Yin Chen, Fangzhen Lin, Lei Li	SELP - A System for Studying Strong Equivalence between Logic Programs.	Answer Set Programming	2005	DBLP BibTeX RDF
1	Chiaki Sakama, Katsumi Inoue	Inductive Equivalence of Logic Programs.	ILP	2005	DBLP DOI BibTeX RDF
1	Sergei P. Odintsov, David Pearce	Routley Semantics for Answer Sets.	LPNMR	2005	DBLP DOI BibTeX RDF
1	Kewen Wang, Yan Zhang	Nested Epistemic Logic Programs.	LPNMR	2005	DBLP DOI BibTeX RDF
1	Miklós Bartha	Strong Retiming Equivalence of Synchronous Schemes.	CIAA	2005	DBLP DOI BibTeX RDF
1	Thomas Eiter, Michael Fink, Hans Tompits, Stefan Woltran	Simplifying Logic Programs Under Uniform and Strong Equivalence.	LPNMR	2004	DBLP DOI BibTeX RDF
1	Katsumi Inoue, Chiaki Sakama	Equivalence of Logic Programs Under Updates.	JELIA	2004	DBLP DOI BibTeX RDF
1	Agustín Valverde	tabeql: A Tableau Based Suite for Equilibrium Logic.	JELIA	2004	DBLP DOI BibTeX RDF
1	Stefan Woltran	Characterizations for Relativized Notions of Equivalence in Answer Set Programming.	JELIA	2004	DBLP DOI BibTeX RDF
1	Hudson Turner	Strong Equivalence Made Easy: Nested Expressions and Weight Constraints	CoRR	2003	DBLP BibTeX RDF
1	Hudson Turner	Strong equivalence made easy: nested expressions and weight constraints.	TPLP	2003	DBLP DOI BibTeX RDF
1	Pedro Cabalar	Alternative Characterizations for Strong Equivalence of Logic Programs	CoRR	2002	DBLP BibTeX RDF
1	Fangzhen Lin	Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic.	KR	2002	DBLP BibTeX RDF
1	Pedro Cabalar	Alternative characterizations for strong equivalence of logic programs.	NMR	2002	DBLP BibTeX RDF
1	Pedro Cabalar	A Three-Valued Characterization for Strong Equivalence of Logic Programs.	AAAI/IAAI	2002	DBLP BibTeX RDF
1	Vladimir Lifschitz, David Pearce, Agustín Valverde	Strongly equivalent logic programs.	ACM Trans. Comput. Log.	2001	DBLP DOI BibTeX RDF	logic programming, stable models, answer sets
1	Mauricio Osorio, Juan Antonio Navarro Pérez, José Arrazola	Equivalence in Answer Set Programming.	LOPSTR	2001	DBLP DOI BibTeX RDF
1	Gabriel Istrate	The Strong Equivalence of ET0L Grammars.	Inf. Process. Lett.	1997	DBLP DOI BibTeX RDF
1	Maciej Kandulski	Strong Equivalence of Generalized Ajdukiewicz and Lambek Grammars.	LACL	1997	DBLP DOI BibTeX RDF
1	Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini	Representing and Reasoning on SGML Documents.	ISMIS	1997	DBLP DOI BibTeX RDF
1	Gian Luigi Ferrari, Ugo Montanari, Paola Quaglia	The Weak Late pi-Calculus Semantics as Observation Equivalence.	CONCUR	1995	DBLP DOI BibTeX RDF
1	Gabriel Istrate	The Strong Equivalence of ETOL Grammars.	Developments in Language Theory	1993	DBLP BibTeX RDF
1	Richard Gerber, Insup Lee	CCSR: A Calculus for Communicating Shared Resources.	CONCUR	1990	DBLP DOI BibTeX RDF
1	João Falcão e Cunha	Compositionality and Omniscience in Situation Semantics.	EAIA	1990	DBLP DOI BibTeX RDF
1	Bengt Jonsson, Joachim Parrow	Deciding Bisimulation Equivalences for a Class of Non-Finite-State Programs.	STACS	1989	DBLP DOI BibTeX RDF
1	Flemming Nielson	Program Transformations in a Denotational Setting.	ACM Trans. Program. Lang. Syst.	1985	DBLP DOI BibTeX RDF
1	Douglas R. Troeger	An Axiomatization of D-scheme Strong Equivalence.	J. Comput. Syst. Sci.	1983	DBLP DOI BibTeX RDF
1	Marc H. Graham, Alberto O. Mendelzon	Strong Equivalence of Relational Wxpressions Under Dependencies.	Inf. Process. Lett.	1982	DBLP DOI BibTeX RDF
1	William L. Scherlis	Program Improvement by Internal Specialization.	POPL	1981	DBLP DOI BibTeX RDF
1	Charles R. Baker	Mutual Information, Strong Equivalence, and Signal Sample Path Properties for Gaussian Properties	Information and Control	1979	RDF
1	Calvin C. Elgot	A representative strong equivalence class for accessible flowchart schemes.	Mathematical Studies of Information Processing	1978	DBLP DOI BibTeX RDF