Search results for "LFCS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Bob Milnikel	The Logic of Uncertain Justifications.	LFCS	2013	DBLP DOI BibTeX RDF
1	Alejandro Díaz-Caro, Giulio Manzonetto, Michele Pagani	Call-by-Value Non-determinism in a Linear Logic Type Discipline.	LFCS	2013	DBLP DOI BibTeX RDF
1	Alexey Sorokin	Normal Forms for Multiple Context-Free Languages and Displacement Lambek Grammars.	LFCS	2013	DBLP DOI BibTeX RDF
1	Jacques Duparc, Olivier Finkel, Jean-Pierre Ressayre	The Wadge Hierarchy of Petri Nets ω-Languages.	LFCS	2013	DBLP DOI BibTeX RDF
1	Junhua Yu	Self-referentiality in the Brouwer-Heyting-Kolmogorov Semantics of Intuitionistic Logic.	LFCS	2013	DBLP DOI BibTeX RDF
1	Roman Kuznets, Thomas Studer	Update as Evidence: Belief Expansion.	LFCS	2013	DBLP DOI BibTeX RDF
1	Marc Bender, Jeffery I. Zucker	Assignment Calculus: A Pure Imperative Language.	LFCS	2013	DBLP DOI BibTeX RDF
1	Çagil Tasdemir	On Tolerance Analysis of Games with Belief Revision.	LFCS	2013	DBLP DOI BibTeX RDF
1	Robert S. Lubarsky, Hannes Diener	Separating the Fan Theorem and Its Weakenings.	LFCS	2013	DBLP DOI BibTeX RDF
1	Thomas Brihaye, Julie De Pril, Sven Schewe	Multiplayer Cost Games with Simple Nash Equilibria.	LFCS	2013	DBLP DOI BibTeX RDF
1	Konstantinos Georgatos	Iterated Contraction Based on Indistinguishability.	LFCS	2013	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Anil Nerode (eds.)	Logical Foundations of Computer Science, International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings	LFCS	2013	DBLP DOI BibTeX RDF
1	John Case, Sanjay Jain 0001, Frank Stephan 0001	Effectivity Questions for Kleene's Recursion Theorem.	LFCS	2013	DBLP DOI BibTeX RDF
1	Alex Brik, Jeffrey B. Remmel	Forward Chaining for Hybrid ASP.	LFCS	2013	DBLP DOI BibTeX RDF
1	Jeroen P. Goudsmit	A Note on Extensions: Admissible Rules via Semantics.	LFCS	2013	DBLP DOI BibTeX RDF
1	Jean-Pierre Talpin, Jens Brandt 0001, Mike Gemünde, Klaus Schneider 0001, Sandeep K. Shukla	Constructive Polychronous Systems.	LFCS	2013	DBLP DOI BibTeX RDF
1	Rutger Kuyper	Computational Hardness of Validity in Probability Logic.	LFCS	2013	DBLP DOI BibTeX RDF
1	Bruno Woltzenlogel Paleo	Contextual Natural Deduction.	LFCS	2013	DBLP DOI BibTeX RDF
1	Agata Ciabattoni, Ori Lahav 0001, Lara Spendier, Anna Zamansky	Automated Support for the Investigation of Paraconsistent and Other Logics.	LFCS	2013	DBLP DOI BibTeX RDF
1	Ren-June Wang	Temporalizing Modal Epistemic Logic.	LFCS	2013	DBLP DOI BibTeX RDF
1	Gilles Barthe, Juan Manuel Crespo, César Kunz	Beyond 2-Safety: Asymmetric Product Programs for Relational Program Verification.	LFCS	2013	DBLP DOI BibTeX RDF
1	Sebastian Wyman	Conservatively Approximable Functions.	LFCS	2013	DBLP DOI BibTeX RDF
1	Luca Aceto, Anna Ingólfsdóttir, Cristian Prisacariu, Joshua Sack	Compositional Reasoning for Multi-modal Logics.	LFCS	2013	DBLP DOI BibTeX RDF
1	Elisabetta De Maria, Angelo Montanari, Nicola Vitacolonna	Games on Strings with a Limited Order Relation.	LFCS	2009	DBLP DOI BibTeX RDF
1	Stefan Hetzl, Alexander Leitsch, Daniel Weller 0001, Bruno Woltzenlogel Paleo	A Clausal Approach to Proof Analysis in Second-Order Logic.	LFCS	2009	DBLP DOI BibTeX RDF
1	Samuel R. Buss, Roman Kuznets	The NP-Completeness of Reflected Fragments of Justification Logics.	LFCS	2009	DBLP DOI BibTeX RDF
1	Thomas Brihaye, Arnaud Da Costa Lopes, François Laroussinie, Nicolas Markey	ATL with Strategy Contexts and Bounded Memory.	LFCS	2009	DBLP DOI BibTeX RDF
1	Uwe Keller, Stijn Heymans	Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm.	LFCS	2009	DBLP DOI BibTeX RDF
1	Eduardo Bonelli, Federico Feller	The Logic of Proofs as a Foundation for Certifying Mobile Computation.	LFCS	2009	DBLP DOI BibTeX RDF
1	Antonio Bucciarelli, Thomas Ehrhard, Giulio Manzonetto	A Relational Model of a Parallel and Non-deterministic lambda-Calculus.	LFCS	2009	DBLP DOI BibTeX RDF	denotational semantics, relational model, ?-calculus, non-determinism, parallel composition
1	Rosalie Iemhoff, George Metcalfe	Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics.	LFCS	2009	DBLP DOI BibTeX RDF
1	James Worthington	A Bialgebraic Approach to Automata and Formal Language Theory.	LFCS	2009	DBLP DOI BibTeX RDF
1	Arnon Avron, Anna Zamansky	Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination.	LFCS	2009	DBLP DOI BibTeX RDF
1	Antoine Genitrini, Jakub Kozik	Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System.	LFCS	2009	DBLP DOI BibTeX RDF
1	Robert S. Lubarsky	Topological Forcing Semantics with Settling.	LFCS	2009	DBLP DOI BibTeX RDF	topology AMS classification 03F50, 03E70, 03C90, semantics, set theory, Constructivism
1	Sebastiaan Terwijn	Decidability and Undecidability in Probability Logic.	LFCS	2009	DBLP DOI BibTeX RDF
1	Wojciech Moczydlowski	Unifying Sets and Programs via Dependent Types.	LFCS	2009	DBLP DOI BibTeX RDF
1	Hidenori Kurokawa	Tableaux and Hypersequents for Justification Logic.	LFCS	2009	DBLP DOI BibTeX RDF
1	Anil Seth	Games on Multi-stack Pushdown Systems.	LFCS	2009	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Anil Nerode (eds.)	Logical Foundations of Computer Science, International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings	LFCS	2009	DBLP DOI BibTeX RDF
1	Yury Savateev	Product-Free Lambek Calculus Is NP-Complete.	LFCS	2009	DBLP DOI BibTeX RDF
1	Kohtaro Tadaki	Fixed Point Theorems on Partial Randomness.	LFCS	2009	DBLP DOI BibTeX RDF	partial randomness, Chaitin’s ? number, algorithmic information theory, thermodynamic quantities, fixed point theorem, Algorithmic randomness
1	Amélie Gheerbrant, Balder ten Cate	Complete Axiomatizations of MSO, FO(TC1)and FO(LFP1)on Finite Trees.	LFCS	2009	DBLP DOI BibTeX RDF	Fragments of MSO, Henkin semantics, Ehrenfeucht-Fraïssé games, Feferman-Vaught theorems, Trees, Axiomatizations
1	Max I. Kanovich	Light Linear Logic with Controlled Weakening.	LFCS	2009	DBLP DOI BibTeX RDF
1	Robert Saxon Milnikel	Conservativity for Logics of Justified Belief.	LFCS	2009	DBLP DOI BibTeX RDF
1	Renata P. de Freitas, Sheila R. M. Veloso, Paulo A. S. Veloso, Jorge Petrucio Viana	Positive Fork Graph Calculus.	LFCS	2009	DBLP DOI BibTeX RDF	Positive relational calculi, fork algebras, graph calculus, completeness, decidability
1	Carlos Areces, Santiago Figueira, Sergio Mera	Completeness Results for Memory Logics.	LFCS	2009	DBLP DOI BibTeX RDF
1	Phiniki Stouppa, Thomas Studer	Data Privacy for Knowledge Bases.	LFCS	2009	DBLP DOI BibTeX RDF
1	Stefano Aguzzoli, Simone Bova, Vincenzo Marra	Applications of Finite Duality to Locally Finite Varieties of BL-Algebras.	LFCS	2009	DBLP DOI BibTeX RDF	prime filters, free BL-algebras, subvarieties of BL-algebras, locally finite varieties, dualities, BL-algebras
1	Nicolas Bedon	Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings.	LFCS	2009	DBLP DOI BibTeX RDF
1	Valentin Goranko, Dmitry Shkatov	Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic.	LFCS	2009	DBLP DOI BibTeX RDF
1	Pedro Baltazar, Paulo Mateus	Temporalization of Probabilistic Propositional Logic.	LFCS	2009	DBLP DOI BibTeX RDF
1	Andrea Masini, Luca Viganò 0001, Marco Volpe 0001	A Labeled Natural Deduction System for a Fragment of CTL*.	LFCS	2009	DBLP DOI BibTeX RDF
1	Ugo Dal Lago, Luca Roversi, Luca Vercelli	Taming Modal Impredicativity: Superlazy Reduction.	LFCS	2009	DBLP DOI BibTeX RDF	Linear logic, proof theory, implicit computational complexity
1	Victor W. Marek, Jeffrey B. Remmel	Automata and Answer Set Programming.	LFCS	2009	DBLP DOI BibTeX RDF
1	Roman Kuznets	Proof Identity for Classical Logic: Generalizing to Normality.	LFCS	2007	DBLP DOI BibTeX RDF
1	André Platzer	A Temporal Dynamic Logic for Verifying Hybrid System Invariants.	LFCS	2007	DBLP DOI BibTeX RDF	logic for hybrid systems, deductive verification of embedded systems, temporal logic, dynamic logic, sequent calculus
1	Raffaella Gentilini, Klaus Schneider 0001, Bud Mishra	Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking.	LFCS	2007	DBLP DOI BibTeX RDF
1	André Nies, Pavel Semukhin	Finite Automata Presentable Abelian Groups.	LFCS	2007	DBLP DOI BibTeX RDF
1	Bjørn Kjos-Hanssen, Anil Nerode	The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion.	LFCS	2007	DBLP DOI BibTeX RDF	law of the iterated logarithm, randomness, Kolmogorov complexity, Brownian motion
1	Benedikt Bollig, Ingmar Meinecke	Weighted Distributed Systems and Their Logics.	LFCS	2007	DBLP DOI BibTeX RDF
1	Sergei N. Artëmov, Eduardo Bonelli	The Intensional Lambda Calculus.	LFCS	2007	DBLP DOI BibTeX RDF
1	Bakhadyr Khoussainov, Jiamou Liu	On Complexity of Ehrenfeucht-Fraïssé Games.	LFCS	2007	DBLP DOI BibTeX RDF
1	Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel J. Rivera	Elementary Differential Calculus on Discrete and Hybrid Structures.	LFCS	2007	DBLP DOI BibTeX RDF	convergence space, hybrid structure, Differential, discrete structure
1	Robert S. Lubarsky, Michael Rathjen	On the Constructive Dedekind Reals: Extended Abstract.	LFCS	2007	DBLP DOI BibTeX RDF
1	Vladimir V. Rybakov	Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms.	LFCS	2007	DBLP DOI BibTeX RDF	admissible inference rules, Temporal logic, linear temporal logic, branching time logic
1	Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco	On Decidability and Expressiveness of Propositional Interval Neighborhood Logics.	LFCS	2007	DBLP DOI BibTeX RDF	neighbourhood interval logics, decidability, expressiveness
1	Sergei N. Artëmov, Anil Nerode (eds.)	Logical Foundations of Computer Science, International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings	LFCS	2007	DBLP DOI BibTeX RDF
1	Srikanth Gottipati, Anil Nerode	A Synthesis Algorithm for Hybrid Systems.	LFCS	2007	DBLP DOI BibTeX RDF
1	Rohit Parikh	Some Puzzles About Probability and Probabilistic Conditionals.	LFCS	2007	DBLP DOI BibTeX RDF
1	Robert L. Constable, Wojciech Moczydlowski	Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus.	LFCS	2007	DBLP DOI BibTeX RDF
1	Hidenori Kurokawa	Hypersequent Calculus for Intuitionistic Logic with Classical Atoms.	LFCS	2007	DBLP DOI BibTeX RDF
1	Rémi Brochenin, Stéphane Demri, Étienne Lozes	Reasoning About Sequences of Memory States.	LFCS	2007	DBLP DOI BibTeX RDF
1	Evan Goris	Explicit Proofs in Formal Provability Logic.	LFCS	2007	DBLP DOI BibTeX RDF
1	Max I. Kanovich	A Note on Rewriting Proofs and Fibonacci Numbers.	LFCS	2007	DBLP DOI BibTeX RDF	multiset rewriting, partition identities, termination, combinatorics, confluence, Fibonacci numbers, strong normalization, Church-Rosser property, integer partitions
1	David Steiner 0001, Thomas Studer	Total Public Announcements.	LFCS	2007	DBLP DOI BibTeX RDF
1	Virgile Mogbil, Vincent Rahli	Uniform Circuits, & Boolean Proof Nets.	LFCS	2007	DBLP DOI BibTeX RDF
1	Michael O'Connor	Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic.	LFCS	2007	DBLP DOI BibTeX RDF
1	Agata Ciabattoni, George Metcalfe	Density Elimination and Rational Completeness for First-Order Logics.	LFCS	2007	DBLP DOI BibTeX RDF
1	Brian F. Redmond	Multiplexor Categories and Models of Soft Linear Logic.	LFCS	2007	DBLP DOI BibTeX RDF	Categorical semantics, Soft Linear Logic, Polynomial time, Game semantics
1	Melvin Fitting	Realizations and LP.	LFCS	2007	DBLP DOI BibTeX RDF
1	Kai Engelhardt, Peter Gammie, Ron van der Meyden	Model Checking Knowledge and Linear Time: PSPACE Cases.	LFCS	2007	DBLP DOI BibTeX RDF
1	Zohar Manna, Henny B. Sipma, Ting Zhang 0001	Verifying Balanced Trees.	LFCS	2007	DBLP DOI BibTeX RDF
1	Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier	Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!	LFCS	2007	DBLP DOI BibTeX RDF
1	Arnon Avron, Anna Zamansky	Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers.	LFCS	2007	DBLP DOI BibTeX RDF
1	Victor W. Marek, Jeffrey B. Remmel	Compactness Properties for Stable Semantics of Logic Programs.	LFCS	2007	DBLP DOI BibTeX RDF
1	Bernhard Heinemann	Including the Past in 'Topologic'.	LFCS	2007	DBLP DOI BibTeX RDF	the logic of knowledge, modal logic, hybrid logic, topological reasoning, temporal operators
1	Evangelia Antonakos	Justified and Common Knowledge: Limited Conservativity.	LFCS	2007	DBLP DOI BibTeX RDF	justified knowledge, Artemov, conservative, common knowledge
1	Jennifer M. Davoren	Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics.	LFCS	2007	DBLP DOI BibTeX RDF
1	Stéphane Demri, Deepak D'Souza, Régis Gascon	A Decidable Temporal Logic of Repeating Values.	LFCS	2007	DBLP DOI BibTeX RDF
1	Guillaume Burel, Claude Kirchner	Cut Elimination in Deduction Modulo by Abstract Completion.	LFCS	2007	DBLP DOI BibTeX RDF	Knuth-Bendix completion, automated deduction and interactive theorem proving, proof ordering, abstract canonical system, cut elimination, deduction modulo
1	G. S. Makanin, Habib Abdulrab, Pavel Goralcik	Functions for the General Solution of Parametric Word Equations.	LFCS	1997	DBLP DOI BibTeX RDF
1	Maurice Margenstern	Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey.	LFCS	1997	DBLP DOI BibTeX RDF
1	Yuri V. Matiyasevich	Some Decision Problems for Traces.	LFCS	1997	DBLP DOI BibTeX RDF
1	Alexei Lisitsa 0001, Vladimir Yu. Sazonov	On Linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets.	LFCS	1997	DBLP DOI BibTeX RDF
1	Valery Durnev	Studying Algorithmic Problems for Free Semi-groups and Groups.	LFCS	1997	DBLP DOI BibTeX RDF
1	Vladimir V. Rybakov	Quasi-Characteristic Inference Rules for Modal Logics.	LFCS	1997	DBLP DOI BibTeX RDF
1	Robert F. Stärk	Formal Verification of Logic Programs: Foundations and Implementation.	LFCS	1997	DBLP DOI BibTeX RDF
1	Martin Otto 0001	Capturing Bisimulation-Invariant Ptime.	LFCS	1997	DBLP DOI BibTeX RDF
1	Rostislav E. Yavorsky	Logical Schemes for First-Order Theories.	LFCS	1997	DBLP DOI BibTeX RDF

Publications at "LFCS"( http://dblp.L3S.de/Venues/LFCS )