Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings / / edited by Kamal Lodaya, Meena Mahajan
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings / / edited by Kamal Lodaya, Meena Mahajan |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 532 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Programming languages (Electronic computers) Mathematical logic Algorithms Software Engineering/Programming and Operating Systems Theory of Computation Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-30538-6 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Genome Halving Problem Revisited -- Verifying Probabilistic Procedural Programs -- Streaming Algorithms for Geometric Problems -- Toward a Grainless Semantics for Shared-Variable Concurrency -- Regular Languages, Unambiguous Concatenation and Computational Complexity -- Contributed Papers -- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets -- On the Urgency Expressiveness -- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages -- A Decidable Fragment of Separation Logic -- Approximate Range Searching Using Binary Space Partitions -- Representable Disjoint NP-Pairs -- Symbolic Reachability Analysis of Higher-Order Context-Free Processes -- Optimal Strategies in Priced Timed Game Automata -- A Calculus for Trust Management -- Short-Cuts on Star, Source and Planar Unfoldings -- Subdividing Alpha Complex -- Real-Counter Automata and Their Decision Problems -- Adjunct Elimination Through Games in Static Ambient Logic -- On the Bisimulation Invariant Fragment of Monadic ?1 in the Finite -- On the Complexity of Hilbert’s 17th Problem -- Who is Pointing When to Whom? -- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix -- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems -- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS -- Minimum Weight Pseudo-Triangulations -- Join Algorithms for the Theory of Uninterpreted Functions -- No, Coreset, No Cry -- Hardness Hypotheses, Derandomization, and Circuit Complexity -- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract -- Learning Languages from Positive Data and a Finite Number of Queries -- The Complexity of the Local Hamiltonian Problem -- Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds -- Adaptive Stabilization of Reactive Protocols -- Visibly Pushdown Games -- Refinement and Separation Contexts -- Decidability of MSO Theories of Tree Structures -- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks -- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size -- Testing Geometric Convexity -- Complexity of Linear Connectivity Problems in Directed Hypergraphs -- Actively Learning to Verify Safety for FIFO Automata -- Reasoning About Game Equilibria Using Temporal Logic -- Alternation in Equational Tree Automata Modulo XOR. |
| Record Nr. | UNISA-996466354203316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings / / edited by Kamal Lodaya, Meena Mahajan
| FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science [[electronic resource] ] : 24th International Conference, Chennai, India, December 16-18, 2004, Proceedings / / edited by Kamal Lodaya, Meena Mahajan |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVI, 532 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computers Computer logic Programming languages (Electronic computers) Mathematical logic Algorithms Software Engineering/Programming and Operating Systems Theory of Computation Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Mathematical Logic and Formal Languages Algorithm Analysis and Problem Complexity |
| ISBN | 3-540-30538-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Genome Halving Problem Revisited -- Verifying Probabilistic Procedural Programs -- Streaming Algorithms for Geometric Problems -- Toward a Grainless Semantics for Shared-Variable Concurrency -- Regular Languages, Unambiguous Concatenation and Computational Complexity -- Contributed Papers -- Decidability of Zenoness, Syntactic Boundedness and Token-Liveness for Dense-Timed Petri Nets -- On the Urgency Expressiveness -- Asynchronous Automata-Theoretic Characterization of Aperiodic Trace Languages -- A Decidable Fragment of Separation Logic -- Approximate Range Searching Using Binary Space Partitions -- Representable Disjoint NP-Pairs -- Symbolic Reachability Analysis of Higher-Order Context-Free Processes -- Optimal Strategies in Priced Timed Game Automata -- A Calculus for Trust Management -- Short-Cuts on Star, Source and Planar Unfoldings -- Subdividing Alpha Complex -- Real-Counter Automata and Their Decision Problems -- Adjunct Elimination Through Games in Static Ambient Logic -- On the Bisimulation Invariant Fragment of Monadic ?1 in the Finite -- On the Complexity of Hilbert’s 17th Problem -- Who is Pointing When to Whom? -- An Almost Linear Time Approximation Algorithm for the Permanent of a Random (0-1) Matrix -- Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems -- Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS -- Minimum Weight Pseudo-Triangulations -- Join Algorithms for the Theory of Uninterpreted Functions -- No, Coreset, No Cry -- Hardness Hypotheses, Derandomization, and Circuit Complexity -- Improved Approximation Algorithms for Maximum Graph Partitioning Problems Extended Abstract -- Learning Languages from Positive Data and a Finite Number of Queries -- The Complexity of the Local Hamiltonian Problem -- Quantum and Classical Communication-Space Tradeoffs from Rectangle Bounds -- Adaptive Stabilization of Reactive Protocols -- Visibly Pushdown Games -- Refinement and Separation Contexts -- Decidability of MSO Theories of Tree Structures -- Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks -- Monotone Multilinear Boolean Circuits for Bipartite Perfect Matching Require Exponential Size -- Testing Geometric Convexity -- Complexity of Linear Connectivity Problems in Directed Hypergraphs -- Actively Learning to Verify Safety for FIFO Automata -- Reasoning About Game Equilibria Using Temporal Logic -- Alternation in Equational Tree Automata Modulo XOR. |
| Record Nr. | UNINA-9910483045403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic and Its Applications [[electronic resource] ] : 5th International Conference, ICLA 2013, Chennai, India, January 10-12, 2013, Proceedings / / edited by Kamal Lodaya
| Logic and Its Applications [[electronic resource] ] : 5th International Conference, ICLA 2013, Chennai, India, January 10-12, 2013, Proceedings / / edited by Kamal Lodaya |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 259 p. 18 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Artificial intelligence Computer science—Mathematics Discrete mathematics Image processing—Digital techniques Computer vision Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Artificial Intelligence Theory of Computation Discrete Mathematics in Computer Science Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-36039-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Constructive Decision Theory (Extended Abstract) -- Bisimulation and Coverings for Graphs and Hypergraphs -- Forcing Axioms, Finite Conditions and Some More -- A Note on Axiomatisations of Two-Dimensional Modal Logics -- The Birth of Proof: Modality and Deductive Reasoning -- Indiscrete Models: Model Building and Model Checking over Linear Time -- Probabilistic IF Logic -- Contributed Papers -- Tableaux-Based Decision Method for Single-Agent Linear Time -- Synchronous Temporal Epistemic Logics with Interacting Time and Knowledge -- Agent-Time Epistemics and Coordination -- Dynamic Epistemic Logic for Channel-Based Agent Communication -- On Kripke’s Puzzle about Time and Thought -- Yablo Sequences in Truth Theories -- Moving Up and Down in the Generic Multiverse -- Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic -- Cut Elimination for Gentzen’s Sequent Calculus with Equality and Logic of Partial Terms -- Logic of Non-monotonic Interactive Proofs.-Noninterference for Intuitionist Necessity -- Many-Valued Logics, Fuzzy Logics and Graded Consequence: A Comparative Appraisal -- Fuzzy Preorder, Fuzzy Topology and Fuzzy Transition System -- Public Announcements for Non-omniscient Agents -- Subset Space Logic with Arbitrary Announcements -- Subset Space Public Announcement Logic. |
| Record Nr. | UNISA-996465974803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic and Its Applications [[electronic resource] ] : 5th International Conference, ICLA 2013, Chennai, India, January 10-12, 2013, Proceedings / / edited by Kamal Lodaya
| Logic and Its Applications [[electronic resource] ] : 5th International Conference, ICLA 2013, Chennai, India, January 10-12, 2013, Proceedings / / edited by Kamal Lodaya |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (X, 259 p. 18 illus.) |
| Disciplina | 005.131 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Machine theory
Computer science Artificial intelligence Computer science—Mathematics Discrete mathematics Image processing—Digital techniques Computer vision Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Artificial Intelligence Theory of Computation Discrete Mathematics in Computer Science Computer Imaging, Vision, Pattern Recognition and Graphics |
| ISBN | 3-642-36039-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Constructive Decision Theory (Extended Abstract) -- Bisimulation and Coverings for Graphs and Hypergraphs -- Forcing Axioms, Finite Conditions and Some More -- A Note on Axiomatisations of Two-Dimensional Modal Logics -- The Birth of Proof: Modality and Deductive Reasoning -- Indiscrete Models: Model Building and Model Checking over Linear Time -- Probabilistic IF Logic -- Contributed Papers -- Tableaux-Based Decision Method for Single-Agent Linear Time -- Synchronous Temporal Epistemic Logics with Interacting Time and Knowledge -- Agent-Time Epistemics and Coordination -- Dynamic Epistemic Logic for Channel-Based Agent Communication -- On Kripke’s Puzzle about Time and Thought -- Yablo Sequences in Truth Theories -- Moving Up and Down in the Generic Multiverse -- Constructing Cut Free Sequent Systems with Context Restrictions Based on Classical or Intuitionistic Logic -- Cut Elimination for Gentzen’s Sequent Calculus with Equality and Logic of Partial Terms -- Logic of Non-monotonic Interactive Proofs.-Noninterference for Intuitionist Necessity -- Many-Valued Logics, Fuzzy Logics and Graded Consequence: A Comparative Appraisal -- Fuzzy Preorder, Fuzzy Topology and Fuzzy Transition System -- Public Announcements for Non-omniscient Agents -- Subset Space Logic with Arbitrary Announcements -- Subset Space Public Announcement Logic. |
| Record Nr. | UNINA-9910484464103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||