Search results for "countermodels"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
113	Michael Fink 0001	Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There.	ICLP	2008	DBLP DOI BibTeX RDF	uniform equivalence, knowledge representation, program optimization, answer-set programming
84	James Lipton, Michael J. O'Donnell	Intuitive Counterexamples for Constructive Fallacies.	MFCS	1994	DBLP DOI BibTeX RDF
57	Dominique Larchey-Wendling	Graph-based Decision for Gödel-Dummett Logics.	J. Autom. Reason.	2007	DBLP DOI BibTeX RDF	Gödel-Dummett logic, countermodels, graphs, decision procedures, sequent calculus
42	Pedro Cabalar, David Pearce 0001, Agustín Valverde	Minimal Logic Programs.	ICLP	2007	DBLP DOI BibTeX RDF	minimisation of boolean and multivalued functions, logic programming, answer set programming
30	Tomasz F. Skura	Finite Tree-Countermodels via Refutation Systems in Extensions of Positive Logic with Strong Negation.	Logica Universalis	2023	DBLP DOI BibTeX RDF
30	Thomas Feller 0001, Tim S. Lyon, Piotr Ostropolski-Nalewaja, Sebastian Rudolph	Decidability of Querying First-Order Theories via Countermodels of Finite Width.	CoRR	2023	DBLP DOI BibTeX RDF
30	Agata Ciabattoni, Nicola Olivetti, Xavier Parent	Dyadic Obligations: Proofs and Countermodels via Hypersequents.	PRIMA	2022	DBLP DOI BibTeX RDF
30	Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel	Hypersequent calculi for non-normal modal and deontic logics: countermodels and optimal complexity.	J. Log. Comput.	2021	DBLP DOI BibTeX RDF
30	Tiziano Dalmonte, Charles Grellois, Nicola Olivetti	Terminating Calculi and Countermodels for Constructive Modal Logics.	TABLEAUX	2021	DBLP DOI BibTeX RDF
30	Willi Hieke, Francesco Kriegel, Adrian Nuradiansyah	Repairing EL TBoxes by Means of Countermodels Obtained by Model Transformation.	Description Logics	2021	DBLP BibTeX RDF
30	Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti, Elaine Pimentel	Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity.	CoRR	2020	DBLP BibTeX RDF
30	Björn Lellmann	Combining Monotone and Normal Modal Logic in Nested Sequents - with Countermodels.	TABLEAUX	2019	DBLP DOI BibTeX RDF
30	Camillo Fiorentini	An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic.	IJCAI	2019	DBLP DOI BibTeX RDF
30	Alexei Lisitsa 0001	Revisiting MU-Puzzle. A Case Study in Finite Countermodels Verification.	RP	2018	DBLP DOI BibTeX RDF
30	Sara Negri	Proofs and Countermodels in Non-Classical Logics.	Logica Universalis	2014	DBLP DOI BibTeX RDF
30	Sara Negri	On the Duality of Proofs and Countermodels in Labelled Sequent Calculi.	TABLEAUX	2013	DBLP DOI BibTeX RDF
30	Valerio Genovese, Deepak Garg 0001, Daniele Rispoli	Labeled Sequent Calculi for Access Control Logics: Countermodels, Saturation and Abduction.	CSF	2012	DBLP DOI BibTeX RDF
30	Deepak Garg 0001, Valerio Genovese, Sara Negri	Countermodels from Sequent Calculi in Multi-Modal Logics.	LICS	2012	DBLP DOI BibTeX RDF
30	Alexei Lisitsa 0001	Finite countermodels for safety verification of parameterized tree systems	CoRR	2011	DBLP BibTeX RDF
30	Michael Fink 0001	A general framework for equivalences in Answer-Set Programming by countermodels in the logic of Here-and-There.	Theory Pract. Log. Program.	2011	DBLP DOI BibTeX RDF
30	Michael Fink 0001	A General Framework for Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There	CoRR	2010	DBLP BibTeX RDF
30	Alexei Lisitsa 0001	Reachability as Derivability, Finite Countermodels and Verification.	ATVA	2010	DBLP DOI BibTeX RDF
30	Alexei Lisitsa 0001	Finite countermodels as invariants. A case study in verification of parameterized mutual exclusion protocol.	WING@ETAPS/IJCAR	2010	DBLP DOI BibTeX RDF
30	Stefano Aguzzoli	An asymptotically tight bound on countermodels for Lukasiewicz logic.	Int. J. Approx. Reason.	2006	DBLP DOI BibTeX RDF
30	Didier Galmiche, Daniel Méry	Resource Graphs and Countermodels in Resource Logics.	D/PDPAR@IJCAR	2004	DBLP DOI BibTeX RDF
30	James Lipton, Michael J. O'Donnell	Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels.	Ann. Pure Appl. Log.	1996	DBLP DOI BibTeX RDF
30	Dolph Ulrich	The finite model property and recursive bounds on the size of countermodels.	J. Philos. Log.	1983	DBLP DOI BibTeX RDF
21	Simone Bova, Franco Montagna	Proof search in Hájek's basic logic.	ACM Trans. Comput. Log.	2008	DBLP DOI BibTeX RDF	countermodel building, Fuzzy logic, automated deduction
21	Didier Galmiche, Yakoub Salhi	Labelled Calculi for Lukasiewicz Logics.	WoLLIC	2008	DBLP DOI BibTeX RDF
21	Xianchun Zou, Heng Zhang	An Algorithm for Weak Disjunctive Normal Form Reduction in G3 Logic.	CSSE (1)	2008	DBLP DOI BibTeX RDF
21	Roger Antonsen, Arild Waaler	A Labelled System for IPL with Variable Splitting.	CADE	2007	DBLP DOI BibTeX RDF
21	Didier Galmiche, Daniel Méry	Characterizing Provability in .	LPAR	2005	DBLP DOI BibTeX RDF
21	Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn	A Decidable Fragment of Separation Logic.	FSTTCS	2004	DBLP DOI BibTeX RDF
21	Didier Galmiche, Daniel Méry, David J. Pym	Resource Tableaux.	CSL	2002	DBLP DOI BibTeX RDF
21	Didier Galmiche, Daniel Méry	Proof-Search and Countermodel Generation in Propositional BI Logic.	TACS	2001	DBLP DOI BibTeX RDF
21	William McCune, Olga Shumsky	System Description: IVY.	CADE	2000	DBLP DOI BibTeX RDF
21	Reinhard Pichler	Algorithms on Atomic Representations of Herbrand Models.	JELIA	1998	DBLP DOI BibTeX RDF
21	Gabriel Aguilera 0001, Inman P. de Guzmán, Manuel Ojeda-Aciego	TAS-D++: Syntactic Trees Transformations for Automated Theorem Proving.	JELIA	1994	DBLP DOI BibTeX RDF