Search results for "finite models"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Howard Straubing	Finite Models, Automata, and Circuit Complexity.	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Rudolf Berghammer, Renate A. Schmidt	Investigating Finite Models of Non-classical Logics with Relation Algebra and RelView.	Theory and Applications of Relational Structures as Knowledge Instruments	2006	DBLP DOI BibTeX RDF
2	Maciej Farulewski	On Finite Models of the Lambek Calculus.	Studia Logica	2005	DBLP DOI BibTeX RDF	finite model property, substructural logics, Lambek Calculus
2	Marcin Mostowski, Konrad Zdanowski	Coprimality in Finite Models.	CSL	2005	DBLP DOI BibTeX RDF
2	John T. Baldwin, Olivier Lessmann	Amalgamation properties and finite models in Ln-theories.	Arch. Math. Log.	2002	DBLP DOI BibTeX RDF
2	Tapani Hyttinen	On stability in finite models.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF
2	Alexei P. Stolboushkin, Michael A. Taitslin	Normalizable linear orders and generic computations in finite models.	Arch. Math. Log.	1999	DBLP DOI BibTeX RDF
2	Gerard Ligozat	Simple Models for Simple Calculi.	COSIT	1999	DBLP DOI BibTeX RDF	spatial constraint networks, RCC calculi, composition tables, scenario, finite models
2	Neil Immerman, Phokion G. Kolaitis (eds.)	Descriptive Complexity and Finite Models, Proceedings of a DIMACS Workshop, January 14-17, 1996, Princeton University	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Bruno Courcelle	On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic.	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	E. Allen Emerson	Model Checking and the Mu-calculus.	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Toniann Pitassi	Algebraic Propositional Proof Systems.	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Victor Vianu	Databases and Finite-Model Theory.	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Moshe Y. Vardi	Why is Modal Logic So Robustly Decidable?	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Ronald Fagin	Easier Ways to Win Logical Games.	Descriptive Complexity and Finite Models	1996	DBLP BibTeX RDF
2	Jian Zhang 0001	Problems on the Generation of Finite Models.	CADE	1994	DBLP DOI BibTeX RDF
2	Tanel Tammet	Using Resolution for Deciding Solvable Classes and Building Finite Models.	Baltic Computer Science	1991	DBLP DOI BibTeX RDF
1	Philipp Lücke, Saharon Shelah	External automorphisms of ultraproducts of finite models.	Arch. Math. Log.	2012	DBLP DOI BibTeX RDF
1	Peifung E. Lam, John C. Mitchell, Andre Scedrov, Sharada Sundaram, Frank Wang	Declarative privacy policy: finite models and attribute-based encryption.	IHI	2012	DBLP DOI BibTeX RDF
1	Jean Goubault-Larrecq	Finite models for formal security proofs.	Journal of Computer Security	2010	DBLP DOI BibTeX RDF
1	Peter Baumgartner, Alexander Fuchs, Hans de Nivelle, Cesare Tinelli	Computing finite models by reduction to function-free clause logic.	J. Applied Logic	2009	DBLP DOI BibTeX RDF
1	Franz Baader, Felix Distel	Exploring Finite Models in the Description Logic .	ICFCA	2009	DBLP DOI BibTeX RDF
1	Jan Jürjens, Tjark Weber	Finite Models in FOL-Based Crypto-Protocol Verification.	ARSPA-WITS	2009	DBLP DOI BibTeX RDF
1	Leonid Libkin	The finite model theory toolbox of a database theoretician.	PODS	2009	DBLP DOI BibTeX RDF	complexity, games, query languages, logics, types, order, expressive power, finite models
1	Stefan S. Dantchev, Barnaby Martin	Cutting Planes and the Parameter Cutwidth.	CiE	2009	DBLP DOI BibTeX RDF
1	Maximiliano Cristiá, Pablo Rodríguez Monetti	Implementing and Applying the Stocks-Carrington Framework for Model-Based Testing.	ICFEM	2009	DBLP DOI BibTeX RDF
1	Sylvain Salvati	Recognizability in the Simply Typed Lambda-Calculus.	WoLLIC	2009	DBLP DOI BibTeX RDF
1	Dov M. Gabbay, Andrzej Szalas	Annotation Theories over Finite Graphs.	Studia Logica	2009	DBLP DOI BibTeX RDF	labeled graphs, semantics of logic programs, second-order quantifier elimination, annotations, argumentation theory
1	Alexandre Matos Arruda, Ana Teresa C. Martins	An Infinitary System for the Least Fixed-Point Logic restricted to Finite Models.	Electr. Notes Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
1	Marcelo Arenas, Pablo Barceló, Leonid Libkin	Game-based notions of locality over finite models.	Ann. Pure Appl. Logic	2008	DBLP DOI BibTeX RDF
1	Dirk Pattinson, Lutz Schröder	Beyond Rank 1: Algebraic Semantics and Finite Models for Coalgebraic Logics.	FoSSaCS	2008	DBLP DOI BibTeX RDF
1	Andriy Dunets, Gerhard Schellhorn, Wolfgang Reif	Automating Algebraic Specifications of Non-freely Generated Data Types.	ATVA	2008	DBLP DOI BibTeX RDF	SAT checking, theorem proving, first-order logic, abstract data types, Algebraic specifications, finite models
1	Jean Goubault-Larrecq	Towards Producing Formally Checkable Security Proofs, Automatically.	CSF	2008	DBLP DOI BibTeX RDF	Dolev-Yao model, h1, security, model-checking, first-order logic, tree automata, proofs, Coq, Paradox
1	Søren Riis	On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity.	LICS	2008	DBLP DOI BibTeX RDF	Algebraic proof complexity, predicate logic, Propositional proof complexity
1	Riccardo Rosati	Finite Model Reasoning in DL-Lite.	ESWC	2008	DBLP DOI BibTeX RDF
1	Hans P. van Ditmarsch, Tim French	Simulation and Information: Quantifying over Epistemic Events.	KRAMAS	2008	DBLP DOI BibTeX RDF	Bisimulation quantifier, temporal epistemic logic, multi-agent system, modal logic
1	Alexander Borgida, Diego Calvanese, Mariano Rodriguez-Muro	Explanation in the DL-LiteFamily of Description Logics.	OTM Conferences	2008	DBLP DOI BibTeX RDF
1	Lawrence S. Moss	Finite Models Constructed from Canonical Formulars.	J. Philosophical Logic	2007	DBLP DOI BibTeX RDF
1	Antonio Badia, Stijn Vansummeren	Non-linear prefixes in query languages.	PODS	2007	DBLP DOI BibTeX RDF	non-linear prefixes, branching, generalized quantifiers, cumulation
1	Stefan S. Dantchev	Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.	STOC	2007	DBLP DOI BibTeX RDF	Lovász-Schrijver proof system, complexity gap theorems, lift and project methods, lower bounds, propositional proof complexity
1	Cong Tian, Zhenhua Duan	Model Checking Propositional Projection Temporal Logic Based on SPIN.	ICFEM	2007	DBLP DOI BibTeX RDF	Propositional Projection Temporal Logic, Model Checking, Verification, Spin, Automaton
1	Matthias Baaz, Agata Ciabattoni, Christian G. Fermüller	Monadic Fragments of Gödel Logics: Decidability and Undecidability Results.	LPAR	2007	DBLP DOI BibTeX RDF
1	Miklós Ajtai	Generalizations of the Compactness Theorem and Gödel's Completeness Theorem for Nonstandard Finite Structures.	TAMC	2007	DBLP DOI BibTeX RDF
1	Leonid Libkin	Embedded Finite Models.	Bulletin of the EATCS	2006	DBLP BibTeX RDF
1	Merlijn Sevenster, Tero Tulenheimo	Partially Ordered Connectives and Sum11 on Finite Models.	CiE	2006	DBLP DOI BibTeX RDF	Henkin quantifiers, partially ordered connectives, NP vs. coNP, finite model theory
1	Gilles Audemard, Belaid Benhamou, Laurent Henocque	Predicting and Detecting Symmetries in FOL Finite Model Search.	J. Autom. Reasoning	2006	DBLP DOI BibTeX RDF	symmetry, constraint programming, finite models
1	Xiangxue Jia, Jian Zhang 0001	A Powerful Technique to Eliminate Isomorphism in Finite Model Search.	IJCAR	2006	DBLP DOI BibTeX RDF	LNH, DASH, scheme, Isomorphism, symmetry breaking
1	Hans de Nivelle, Jia Meng	Geometric Resolution: A Proof Procedure Based on Finite Model Search.	IJCAR	2006	DBLP DOI BibTeX RDF
1	Pavithra Prabhakar, Deepak D'Souza	On the Expressiveness of MTL with Past Operators.	FORMATS	2006	DBLP DOI BibTeX RDF
1	Fernando Soler-Toscano, Ángel Nepomuceno-Fernández	: Tableaux and Resolution for Finite Abduction.	JELIA	2006	DBLP DOI BibTeX RDF
1	Alessandro Artale	Reasoning on temporal class diagrams: Undecidability results.	Ann. Math. Artif. Intell.	2006	DBLP DOI BibTeX RDF	AMS subject classification computer science, knowledge representation, database theory
1	Jan Rauch	Definability of Association Rules in Predicate Calculus.	Foundations and Novel Approaches in Data Mining	2006	DBLP DOI BibTeX RDF
1	Mor Doron, Saharon Shelah	A dichotomy in classifying quantifiers for finite models.	J. Symb. Log.	2005	DBLP BibTeX RDF
1	Michal Krynicki, Konrad Zdanowski	Theories of arithmetics in finite models.	J. Symb. Log.	2005	DBLP BibTeX RDF
1	Marcin Mostowski, Konrad Zdanowski	FM-Representability and Beyond.	CiE	2005	DBLP DOI BibTeX RDF
1	Wieslaw Szwast, Lidia Tendera	On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity.	LPAR	2005	DBLP DOI BibTeX RDF	computational complexity, transitivity, decision problem, guarded fragment, finite model
1	Nina Gierasimczuk	The Problem of Learning the Semantics of Quantifiers.	TbiLLC	2005	DBLP DOI BibTeX RDF
1	Cesare Tinelli, Calogero G. Zarba	Combining Nonstably Infinite Theories.	J. Autom. Reasoning	2005	DBLP DOI BibTeX RDF	combination of decision procedures, Nelson-Oppen method
1	Marcin Mostowski, Anna Wasilewska	Arithmetic of divisibility in finite models.	Math. Log. Q.	2004	DBLP DOI BibTeX RDF
1	Leszek Aleksander Kolodziejczyk	Truth definitions in finite models.	J. Symb. Log.	2004	DBLP BibTeX RDF
1	Marko Djordjevic	On first-order sentences without finite models.	J. Symb. Log.	2004	DBLP BibTeX RDF
1	Argimiro Arratia, Carlos E. Ortiz	Approximating the Expressive Power of Logics in Finite Models.	LATIN	2004	DBLP DOI BibTeX RDF
1	Marcelo Arenas, Pablo Barceló, Leonid Libkin	Game-Based Notions of Locality Over Finite Models.	CSL	2004	DBLP DOI BibTeX RDF
1	Tomás Barros, Rabéa Boulifa, Eric Madelaine	Parameterized Models for Distributed Java Objects.	FORTE	2004	DBLP DOI BibTeX RDF
1	Denis Thérien, Thomas Wilke	Nesting Until and Since in Linear Temporal Logic.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
1	Hervé Fournier	Quantifier rank for parity of embedded finite models.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
1	Nicolas Peltier	A calculus combining resolution and enumeration for building finite models.	J. Symb. Comput.	2003	DBLP DOI BibTeX RDF
1	Nicolas Peltier	A More Efficient Tableaux Procedure for Simultaneous Search for Refutations and Finite Models.	TABLEAUX	2003	DBLP DOI BibTeX RDF
1	Aaron Hunter	Spectrum Hierarchies and Subdiagonal Functions.	LICS	2003	DBLP DOI BibTeX RDF
1	Stefan S. Dantchev, Søren Riis	On Relativisation and Complexity Gap.	CSL	2003	DBLP DOI BibTeX RDF
1	Nikolay V. Shilov, Natalya Olegovna Garanina	Polynomial Approximations for Model Checking.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF	model checking, complexity, Calculus
1	Rabéa Boulifa, Eric Madelaine	Model Generation for Distributed Java Programs.	FIDJI	2003	DBLP DOI BibTeX RDF
1	Viktor Schuppan, Armin Biere	Verifying the IEEE 1394 FireWire Tree Identify Protocol with SMV.	Formal Asp. Comput.	2003	DBLP DOI BibTeX RDF	IEEE 1394 FireWire, Model checking, Formal methods, Protocol verification
1	Wojciech Buszkowski	Finite Models of Some Substructural Logics.	Math. Log. Q.	2002	DBLP DOI BibTeX RDF
1	Jouko A. Väänänen, Dag Westerståhl	On the Expressive Power of Monotone Natural Language Quantifiers over Finite Models.	J. Philosophical Logic	2002	DBLP DOI BibTeX RDF
1	Mikolaj Bojanczyk	Two-Way Alternating Automata and Finite Models.	ICALP	2002	DBLP DOI BibTeX RDF
1	Leona F. Fass	Finite Models for Learning.	JCIS	2002	DBLP BibTeX RDF
1	Marcin Mostowski	On Representing Concepts in Finite Models.	Math. Log. Q.	2001	DBLP DOI BibTeX RDF
1	Marko Djordjevic	Finite Variable Logic, Stability and Finite Models.	J. Symb. Log.	2001	DBLP BibTeX RDF
1	Hervé Fournier	Quantifier Rank for Parity of Embedded Finite Models.	MFCS	2001	DBLP DOI BibTeX RDF	Ehrenfeucht-Fraïssé games, Uniform Quantifier Elimination, Connectivity, Reachability, Parity, Constraint databases
1	Jian Zhang 0001	Automatic symmetry breaking method combined with SAT.	SAC	2001	DBLP DOI BibTeX RDF	symmetry, backtracking search, finite models
1	Gilles Audemard, Laurent Henocque	The eXtended Least Number Heuristic.	IJCAR	2001	DBLP DOI BibTeX RDF
1	Toon Calders, Jef Wijsen	On Monotone Data Mining Languages.	DBPL	2001	DBLP DOI BibTeX RDF
1	Nikolay V. Shilov, Kwang Yi	On Expressive and Model Checking Power of Propositional Program Logics.	Ershov Memorial Conference	2001	DBLP DOI BibTeX RDF
1	Piotr Dembinski, Wojciech Penczek, Agata Pólrola	Automated Verification of Infinite State Concurrent Systems.	PPAM	2001	DBLP BibTeX RDF
1	Stefan Arnborg, Gunnar Sjödin	Bayes Rules in Finite Models.	ECAI	2000	DBLP BibTeX RDF
1	James Laird	Finite Models and Full Completeness.	CSL	2000	DBLP DOI BibTeX RDF	affine logic, full completeness, effective presentability, linear logic, PCF
1	Alexei Lisitsa	Generalized vs formula circumscription over finite models.	AMAI	2000	DBLP BibTeX RDF
1	Thierry Boy de la Tour	Some Techniques of Isomorph-Free Search.	AISC	2000	DBLP DOI BibTeX RDF
1	Tomoko Ninomiya, Masao Mukaidono	Fundamental Properties on Axioms of Kleene Algebra.	ISMIS	2000	DBLP BibTeX RDF
1	Lauri Hella, Leonid Libkin, Juha Nurmonen	Notions of Locality and Their Logical Characterizations over Finite Models.	J. Symb. Log.	1999	DBLP BibTeX RDF
1	Tomoko Ninomiya, Masao Mukaidono	Clarifying the Axioms of Kleene Algebra based on the Method of Indeterminate Coefficients. (PDF / PS)	ISMVL	1999	DBLP DOI BibTeX RDF	the Method of Indeteminate Coefficients, Independency of axiom, Complete axioms, Kleene Algebra
1	Karsten Konrad, David A. Wolfram	System Description: Kimba, A Model Generator for Many-Valued First-Order Logics.	CADE	1999	DBLP DOI BibTeX RDF
1	Carola Eschenbach	A Predication Calculus for Qualitative Spatial Representations.	COSIT	1999	DBLP DOI BibTeX RDF	Topology, Inferences, Axiomatics, Qualitative Spatial Reasoning, Spatial Structure, Predication Calculus, Mereology
1	Daniel Jackson, Yu-Chung Ng, Jeannette M. Wing	A Nitpick Analysis of Mobile IPv6.	Formal Asp. Comput.	1999	DBLP DOI BibTeX RDF	Nitpick, Mobile internetworking protocols, Model checking, Z, Declarative specification
1	John T. Baldwin, Michael Benedikt	Embedded Finite Models, Stability Theory and the Impact of Order.	LICS	1998	DBLP DOI BibTeX RDF
1	Gabriel Sandu	The Logic of Informational Independence and Finite Models.	Logic Journal of the IGPL	1997	DBLP DOI BibTeX RDF
1	Alan R. Woods	Counting Finite Models.	J. Symb. Log.	1997	DBLP BibTeX RDF
1	Lauri Hella, Phokion G. Kolaitis, Kerkko Luosto	How to Define a Linear Order on Finite Models.	Ann. Pure Appl. Logic	1997	DBLP DOI BibTeX RDF
1	Jouko A. Väänänen	Unary Quantifiers on Finite Models.	Journal of Logic, Language and Information	1997	DBLP DOI BibTeX RDF