Search results for "definability"

Hits ?▲	Authors	Title	Venue	Year	Link
16	Pascal Baumann 0001, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche	Existential Definability over the Subword Ordering.	CoRR	2022	DBLP DOI BibTeX RDF
16	Lucy Ham, Marcel Jackson	Finite model theory for pseudovarieties and universal algebra: preservation, definability and complexity.	CoRR	2022	DBLP DOI BibTeX RDF
16	Raine Rönnholm	On definability of team relations with k-invariant atoms.	Ann. Pure Appl. Log.	2022	DBLP DOI BibTeX RDF
16	Haim Horowitz, Saharon Shelah	On the definability of mad families of vector spaces.	Ann. Pure Appl. Log.	2022	DBLP DOI BibTeX RDF
16	Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin	Combination of Uniform Interpolants via Beth Definability.	J. Autom. Reason.	2022	DBLP DOI BibTeX RDF
16	Takahiro Sawasaki, Katsuhiko Sano	Corrigendum to: Frame definability, canonicity and cut elimination in common sense modal predicate logics.	J. Log. Comput.	2022	DBLP DOI BibTeX RDF
16	Pascal Baumann 0001, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche	Existential Definability over the Subword Ordering.	STACS	2022	DBLP DOI BibTeX RDF
16	Ádám Kunos	Definability in the Substructure Ordering of Finite Directed Graphs.	Order	2021	DBLP DOI BibTeX RDF
16	Hajnal Andréka, István Németi	Two-variable Logic has Weak, but not Strong, Beth Definability.	J. Symb. Log.	2021	DBLP DOI BibTeX RDF
16	Shlomo Eshel, Itay Kaplan	On uniform definability of types over finite sets for NIP formulas.	J. Math. Log.	2021	DBLP DOI BibTeX RDF
16	Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev	Deciding FO-definability of Regular Languages.	CoRR	2021	DBLP BibTeX RDF
16	Sebastian Maneth, Helmut Seidl, Martin Vu	Definability Results for Top-Down Tree Transducers.	CoRR	2021	DBLP BibTeX RDF
16	Christof Löding, Sarah Winter	Resynchronized Uniformization and Definability Problems for Rational Relations.	CoRR	2021	DBLP BibTeX RDF
16	Martin Grohe, Daniel Neuen	Isomorphism, canonization, and definability for graphs of bounded rank width.	Commun. ACM	2021	DBLP DOI BibTeX RDF
16	Luca Reggio	Beth definability and the Stone-Weierstrass Theorem.	Ann. Pure Appl. Log.	2021	DBLP DOI BibTeX RDF
16	Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán	Punctual definability on structures.	Ann. Pure Appl. Log.	2021	DBLP DOI BibTeX RDF
16	Lázaro Alberto Larrauri	Probabilities of first-order sentences on sparse random relational structures: An application to definability on random CNF formulas.	J. Log. Comput.	2021	DBLP DOI BibTeX RDF
16	Takahiro Sawasaki, Katsuhiko Sano	Frame definability, canonicity and cut elimination in common sense modal predicate logics.	J. Log. Comput.	2021	DBLP DOI BibTeX RDF
16	Hristo Ganchev, Andrey Sariev	The automorphism group and definability of the jump operator in the ømega-enumeration degrees.	Arch. Math. Log.	2021	DBLP DOI BibTeX RDF
16	Agi Kurucz, Vladislav Ryzhikov, Yury Savateev, Michael Zakharyaschev	Deciding FO-definability of Regular Languages.	RAMiCS	2021	DBLP DOI BibTeX RDF
16	Gianluca Cima, Federico Croce, Maurizio Lenzerini	Query Definability and Its Approximations in Ontology-based Data Management.	CIKM	2021	DBLP DOI BibTeX RDF
16	Sebastian Maneth, Helmut Seidl, Martin Vu	Definability Results for Top-Down Tree Transducers.	DLT	2021	DBLP DOI BibTeX RDF
16	Frank Wolter	Living Without Beth and Craig: Explicit Definitions and Interpolants without Beth Definability and Craig Interpolation (Abstract of Invited Talk).	SOQE@KR	2021	DBLP BibTeX RDF
16	David Toman 0001, Grant E. Wedell	Projective Beth Definability and Craig Interpolation for Relational Query Optimization (Material to Accompany Invited Talk).	SOQE@KR	2021	DBLP BibTeX RDF
16	Benedikt Pago	Choiceless Computation and Symmetry: Limitations of Definability.	CSL	2021	DBLP DOI BibTeX RDF
16	David Toman 0001, Grant E. Weddell	FO Rewritability for OMQ using Beth Definability and Interpolation.	Description Logics	2021	DBLP BibTeX RDF
16	Mikhail R. Starchak	Positive Existential Definability with Unit, Addition and Coprimeness.	ISSAC	2021	DBLP DOI BibTeX RDF
16	Benjamin H. Feintzeig	Correction to: Deduction and definability in infinite statistical systems.	Synth.	2020	DBLP DOI BibTeX RDF
16	Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell 0001	Effective definability of the reachability relation in timed automata.	Inf. Process. Lett.	2020	DBLP DOI BibTeX RDF
16	Marco Barone, Nicolás Caro, Eudes Naziazeno	Uniform Definability of Integers in Reduced indecomposable Polynomial Rings.	J. Symb. Log.	2020	DBLP DOI BibTeX RDF
16	Jean-Marie Lagniez, Emmanuel Lonca, Pierre Marquis	Definability for model counting.	Artif. Intell.	2020	DBLP DOI BibTeX RDF
16	Tin Perkov, Luka Mikec	Existential definability of modal frame classes.	Math. Log. Q.	2020	DBLP DOI BibTeX RDF
16	Tommaso Moraschini, James G. Raftery, Jamie J. Wannenburg	Epimorphisms, Definability and Cardinalities.	Stud Logica	2020	DBLP DOI BibTeX RDF
16	Mikolaj Bojanczyk	Languages recognised by finite semigroups, and their generalisations to objects such as trees and graphs, with an emphasis on definability in monadic second-order logic.	CoRR	2020	DBLP BibTeX RDF
16	Lázaro Alberto Larrauri	Probabilities of first order sentences on sparse random relational structures: An application to definability on random CNF formulas.	CoRR	2020	DBLP BibTeX RDF
16	Dino Mandrioli, Matteo Pradella, Stefano Crespi-Reghizzi	Aperiodicity, Star-freeness, and First-order Definability of Structured Context-Free Languages.	CoRR	2020	DBLP BibTeX RDF
16	Michal R. Przybylek	Beyond sets with atoms: definability in first order logic.	CoRR	2020	DBLP BibTeX RDF
16		An effective version of definability in metric model theory.	CoRR	2020	DBLP BibTeX RDF
16	Ioannis Papantonis, Vaishak Belle	On Constraint Definability in Tractable Probabilistic Models.	CoRR	2020	DBLP BibTeX RDF
16	R. Ramanujam 0001, Ramanathan S. Thinniyam	Definability in first-order theories of graph orderings ⋆.	J. Log. Comput.	2020	DBLP DOI BibTeX RDF
16	Mikhail N. Rybakov, Dmitry Shkatov	Recursive enumerability and elementary frame definability in predicate modal logic.	J. Log. Comput.	2020	DBLP DOI BibTeX RDF
16	Carlos Areces, Miguel Campercholi, Daniel Penazzi, Pablo Ventura	The complexity of definability by open first-order formulas.	Log. J. IGPL	2020	DBLP DOI BibTeX RDF
16	Dino Mandrioli, Matteo Pradella, Stefano Crespi-Reghizzi	Star-Freeness, First-Order Definability and Aperiodicity of Structured Context-Free Languages.	ICTAC	2020	DBLP DOI BibTeX RDF
16	Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin	Combined Covers and Beth Definability.	IJCAR (1)	2020	DBLP DOI BibTeX RDF
16	Yijia Chen, Jörg Flum	FO-Definability of Shrub-Depth.	CSL	2020	DBLP DOI BibTeX RDF
16	Benjamin H. Feintzeig	Deduction and definability in infinite statistical systems.	Synth.	2019	DBLP DOI BibTeX RDF
16	Ádám Kunos	Definability in the Embeddability Ordering of Finite Directed Graphs, II.	Order	2019	DBLP DOI BibTeX RDF
16	Hristo Ganchev, Andrey Sariev	Definability in the local structure of the ω-Turing degrees.	Math. Struct. Comput. Sci.	2019	DBLP DOI BibTeX RDF
16	Lynn D'eer, Chris Cornelis	Decision reducts and bireducts in a covering approximation space and their relationship to set definability.	Int. J. Approx. Reason.	2019	DBLP DOI BibTeX RDF
16	Marat Kh. Faizrahmanov, Asher M. Kach, Iskander Sh. Kalimullin, Antonio Montalbán, Vadim Puzarenko	Jump inversions of algebraic structures and Σ-definability.	Math. Log. Q.	2019	DBLP DOI BibTeX RDF
16	Viktor Verbovskiy	On definability of types and relative stability.	Math. Log. Q.	2019	DBLP DOI BibTeX RDF
16	William Chan 0002	Ordinal definability and combinatorics of equivalence relations.	J. Math. Log.	2019	DBLP DOI BibTeX RDF
16	Bruce E. Litow	Existential Diophantine definability of string length.	Theor. Comput. Sci.	2019	DBLP DOI BibTeX RDF
16	Mikhail N. Rybakov, Dmitry Shkatov	Recursive enumerability and elementary frame definability in predicate modal logic.	CoRR	2019	DBLP BibTeX RDF
16	Martin Grohe, Daniel Neuen	Canonisation and Definability for Graphs of Bounded Rank Width.	CoRR	2019	DBLP BibTeX RDF
16	Diego Calvanese, Silvio Ghilardi, Alessandro Gianola, Marco Montali, Andrey Rivkin	Combined Covers and Beth Definability.	CoRR	2019	DBLP BibTeX RDF
16	Carlos Areces, Miguel Campercholi, Daniel Penazzi, Pablo Ventura	The Complexity of Definability by Open First-Order Formulas.	CoRR	2019	DBLP BibTeX RDF
16	Martin Fränzle, Karin Quaas, Mahsa Shirmohammadi, James Worrell 0001	Effective Definability of the Reachability Relation in Timed Automata.	CoRR	2019	DBLP BibTeX RDF
16	Zuzana Haniková	Implicit definability of truth constants in Łukasiewicz logic.	Soft Comput.	2019	DBLP DOI BibTeX RDF
16	Michael Benedikt, Pierre Bourhis, Michael Vanden Boom	Definability and Interpolation within Decidable Fixpoint Logics.	Log. Methods Comput. Sci.	2019	DBLP DOI BibTeX RDF
16	Katsuhiko Sano, Jonni Virtema	Characterising modal definability of team-based logics via the universal modality.	Ann. Pure Appl. Log.	2019	DBLP DOI BibTeX RDF
16	Antje Rumberg, Alberto Zanardo	First-Order Definability of Transition Structures.	J. Log. Lang. Inf.	2019	DBLP DOI BibTeX RDF
16	Grigory K. Olkhovikov	Justification announcements in discrete time. Part II: Frame definability results.	Log. J. IGPL	2019	DBLP DOI BibTeX RDF
16	Martin Grohe, Daniel Neuen	Canonisation and Definability for Graphs of Bounded Rank Width.	LICS	2019	DBLP DOI BibTeX RDF
16	Miguel Campercholi, Mauricio Tellechea, Pablo Ventura	Deciding Quantifier-free Definability in Finite Algebraic Structures.	LSFA	2019	DBLP DOI BibTeX RDF
16	Valentin Cassano, Raul Fervari, Carlos Areces, Pablo F. Castro	Interpolation and Beth Definability in Default Logics.	JELIA	2019	DBLP DOI BibTeX RDF
16	Yu-Ru Syau, En-Bing Lin, Churn-Jung Liau	Neighborhood Systems: Rough Set Approximations and Definability.	Fundam. Informaticae	2018	DBLP DOI BibTeX RDF
16	Olivier Carton, Thomas Colcombet, Gabriele Puppis	An Algebraic Approach to MSO-Definability on Countable linear Orderings.	J. Symb. Log.	2018	DBLP DOI BibTeX RDF
16	Wei Wang 0150	Relative Definability of n-generics.	J. Symb. Log.	2018	DBLP DOI BibTeX RDF
16	Wied Pakusa, Svenja Schalthöfer, Erkal Selman	Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time.	ACM Trans. Comput. Log.	2018	DBLP DOI BibTeX RDF
16	Murat Diker, Aysegül Altay Ugur	Dicovering approximation spaces and definability.	Int. J. Approx. Reason.	2018	DBLP DOI BibTeX RDF
16	Antonio Montalbán	Coding and Definability in Computable Structures.	Notre Dame J. Formal Log.	2018	DBLP DOI BibTeX RDF
16	Denis Bonnay, Fredrik Engström	Invariance and Definability, with and without Equality.	Notre Dame J. Formal Log.	2018	DBLP DOI BibTeX RDF
16	R. Zoghifard, Massoud Pourmahdian	First-Order Modal Logic: Frame Definability and a Lindström Theorem.	Stud Logica	2018	DBLP DOI BibTeX RDF
16	Zuzana Haniková	Implicit definability of truth constants in Łukasiewicz logic.	CoRR	2018	DBLP BibTeX RDF
16	Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis	One-way definability of two-way word transducers.	Log. Methods Comput. Sci.	2018	DBLP DOI BibTeX RDF
16	Andrew E. M. Lewis-Pye	The search for natural definability in the Turing degrees.	Comput.	2018	DBLP DOI BibTeX RDF
16	Françoise Point	Definability of types and VC density in differential topological fields.	Arch. Math. Log.	2018	DBLP DOI BibTeX RDF
16	Carlos Areces, Miguel Campercholi, Pablo Ventura	Deciding Open Definability via Subisomorphisms.	WoLLIC	2018	DBLP DOI BibTeX RDF
16	Nathan Lhote	Definability and synthesis of transductions. (Définissabilité et synthèse de transductions).		2018	RDF
16	Barry Jay, Jose Vergara	Conflicting accounts of λ-definability.	J. Log. Algebraic Methods Program.	2017	DBLP DOI BibTeX RDF
16	Vahagn Aslanyan	Definability of Derivations in the Reducts of differentially closed Fields.	J. Symb. Log.	2017	DBLP DOI BibTeX RDF
16	Guillermo Badia	Model Definability in Relevant Logic.	FLAP	2017	DBLP BibTeX RDF
16	Lars Jaffke, Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle	Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees.	Eur. J. Comb.	2017	DBLP DOI BibTeX RDF
16	Zhiqiang Zhuang, Maurice Pagnucco, Yan Zhang 0003	Inter-Definability of Horn Contraction and Horn Revision.	J. Philos. Log.	2017	DBLP DOI BibTeX RDF
16	Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens	Deciding definability by deterministic regular expressions.	J. Comput. Syst. Sci.	2017	DBLP DOI BibTeX RDF
16	Félix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis	One-way definability of two-way word transducers.	CoRR	2017	DBLP BibTeX RDF
16	Samson Abramsky	Intensionality, Definability and Computation.	CoRR	2017	DBLP BibTeX RDF
16	Yijia Chen, Jörg Flum, Xuangui Huang	Slicewise definability in first-order logic with bounded quantifier rank.	CoRR	2017	DBLP BibTeX RDF
16	Michael Benedikt, Pierre Bourhis, Michael Vanden Boom	Characterizing Definability in Decidable Fixpoint Logics.	CoRR	2017	DBLP BibTeX RDF
16	Dimiter Georgiev	Definability in the class of all -frames - computability and complexity.	J. Appl. Non Class. Logics	2017	DBLP DOI BibTeX RDF
16	Fan Yang 0004	Uniform Definability in Propositional Dependence Logic.	Rev. Symb. Log.	2017	DBLP DOI BibTeX RDF
16	Philippe Balbiani, Tinko Tinchev	Undecidable problems for modal definability.	J. Log. Comput.	2017	DBLP DOI BibTeX RDF
16	Sergio Abriola, María Emilia Descotte, Santiago Figueira	Model theory of XPath on data trees. Part II: Binary bisimulation and definability.	Inf. Comput.	2017	DBLP DOI BibTeX RDF
16	Ramanathan S. Thinniyam	Definability of Recursive Predicates in the Induced Subgraph Order.	ICLA	2017	DBLP DOI BibTeX RDF
16	Anuj Dawar, Pengming Wang 0001	Definability of semidefinite programming and lasserre lower bounds for CSPs.	LICS	2017	DBLP DOI BibTeX RDF
16	Faried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa	Definability of summation problems for Abelian groups and semigroups.	LICS	2017	DBLP DOI BibTeX RDF
16	Michael Benedikt, Pierre Bourhis, Michael Vanden Boom	Characterizing Definability in Decidable Fixpoint Logics.	ICALP	2017	DBLP DOI BibTeX RDF
16	Nicolas Bacquey, Etienne Grandjean, Frédéric Olive	Definability by Horn Formulas and Linear Time on Cellular Automata.	ICALP	2017	DBLP DOI BibTeX RDF
16	Ping Lu 0007, Zhilin Wu, Haiming Chen	The Complexity of SORE-definability Problems.	MFCS	2017	DBLP DOI BibTeX RDF