Info
Logical foundations of computer science : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings / / Sergei Artemov, Anil Nerode (eds.)
| Logical foundations of computer science : International Symposium, LFCS 2013, San Diego, CA, USA, January 6-8, 2013. Proceedings / / Sergei Artemov, Anil Nerode (eds.) |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, : Springer, c2013 |
| Descrizione fisica | 1 online resource (X, 415 p. 49 illus.) |
| Disciplina | 004 |
| Altri autori (Persone) |
ArtemovS. N
NerodeAnil <1932-> |
| Collana |
Lecture notes in computer science
LNCS sublibrary |
| Soggetto topico |
Computer logic
Computer science |
| ISBN | 3-642-35722-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Constructive mathematics and type theory -- Logic, automata and automatic structures -- Computability and randomness -- Logical foundations of programming -- Logical aspects of computational complexity -- Logic programming and constraints -- Automated deduction and interactive theorem proving -- Logical methods in protocol and program verification -- Logical methods in program specification and extraction -- Domain theory logic -- Logical foundations of database theory -- Equational logic and term rewriting -- Lambda and combinatory calculi -- Categorical logic and topological semantics -- Linear logic -- Epistemic and temporal logics -- Intelligent and multiple agent system logics -- Logics of proof and justification -- Nonmonotonic reasoning -- Logic in game theory and social software -- Logic of hybrid systems -- Distributed system logics -- Mathematical fuzzy logic -- System design logics. |
| Altri titoli varianti | LFCS 2013 |
| Record Nr. | UNINA-9910484250903321 |
| Berlin, : Springer, c2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logical foundations of computer science : International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009 : proceedings / / Sergei N. Artemov, Anil Nerode (eds.)
| Logical foundations of computer science : International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009 : proceedings / / Sergei N. Artemov, Anil Nerode (eds.) |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2009 |
| Descrizione fisica | 1 online resource (XI, 469 p.) |
| Disciplina | 511.3 |
| Altri autori (Persone) |
ArtemovS. N
NerodeAnil <1932-> |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Computer science
Logic, Symbolic and mathematical |
| ISBN | 3-540-92687-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Applications of Finite Duality to Locally Finite Varieties of BL-Algebras -- Completeness Results for Memory Logics -- Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination -- Temporalization of Probabilistic Propositional Logic -- Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings -- The Logic of Proofs as a Foundation for Certifying Mobile Computation -- ATL with Strategy Contexts and Bounded Memory -- A Relational Model of a Parallel and Non-deterministic ?-Calculus -- The NP-Completeness of Reflected Fragments of Justification Logics -- Taming Modal Impredicativity: Superlazy Reduction -- Positive Fork Graph Calculus -- Games on Strings with a Limited Order Relation -- Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees -- Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic -- A Clausal Approach to Proof Analysis in Second-Order Logic -- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics -- Light Linear Logic with Controlled Weakening -- Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm -- Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System -- Tableaux and Hypersequents for Justification Logic -- Topological Forcing Semantics with Settling -- Automata and Answer Set Programming -- A Labeled Natural Deduction System for a Fragment of CTL * -- Conservativity for Logics of Justified Belief -- Unifying Sets and Programs via Dependent Types -- Product-Free Lambek Calculus Is NP-Complete -- Games on Multi-stack Pushdown Systems -- Data Privacy for Knowledge Bases -- Fixed Point Theorems on Partial Randomness -- Decidability and Undecidability in Probability Logic -- A Bialgebraic Approach to Automata and Formal Language Theory. |
| Altri titoli varianti | LFCS 2009 |
| Record Nr. | UNINA-9910768172103321 |
| Berlin ; ; New York, : Springer, c2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||