|
|
|
|
LEADER |
05230nam a22005775i 4500 |
001 |
978-3-540-73445-1 |
003 |
DE-He213 |
005 |
20151204183523.0 |
007 |
cr nn 008mamaa |
008 |
100301s2007 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540734451
|9 978-3-540-73445-1
|
024 |
7 |
|
|a 10.1007/978-3-540-73445-1
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UY
|2 bicssc
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a COM031000
|2 bisacsh
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Logic, Language, Information and Computation
|h [electronic resource] :
|b 14th International Workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2-5, 2007. Proceedings /
|c edited by Daniel Leivant, Ruy de Queiroz.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2007.
|
300 |
|
|
|a X, 366 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4576
|
505 |
0 |
|
|a A Grammatical Representation of Visibly Pushdown Languages -- Fully Lexicalized Pregroup Grammars -- Bounded Lattice T-Norms as an Interval Category -- Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps -- Continuation Semantics for Symmetric Categorial Grammar -- Ehrenfeucht–Fraïssé Games on Linear Orders -- Hybrid Logical Analyses of the Ambient Calculus -- Structured Anaphora to Quantifier Domains: A Unified Account of Quantificational and Modal Subordination -- On Principal Types of BCK-?-Terms -- A Finite-State Functional Grammar Architecture -- Pregroup Calculus as a Logic Functor -- A Formal Calculus for Informal Equality with Binding -- Formal Verification of an Optimal Air Traffic Conflict Resolution and Recovery Algorithm -- An Introduction to Context Logic -- Numerical Constraints for XML -- Modules over Monads and Linearity -- Hydra Games and Tree Ordinals -- Spin Networks, Quantum Topology and Quantum Computation -- Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus -- Computational Interpretations of Classical Linear Logic -- Autonomous Programmable Biomolecular Devices Using Self-assembled DNA Nanostructures -- Interval Valued QL-Implications -- Behavioural Differential Equations and Coinduction for Binary Trees -- A Sketch of a Dynamic Epistemic Semiring -- A Modal Distributive Law (abstract) -- Ant Colony Optimization with Adaptive Fitness Function for Satisfiability Testing.
|
520 |
|
|
|a Welcome to the proceedings of the 14th WoLLIC meeting, which was held in Rio de Janeiro, Brazil, July 2 - 5, 2007. The Workshop on Logic, Language, Information and Computation (WoLLIC) is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. The WoLLIC meetings alternate between Brazil (and Latin America) and other countries, with the aim of fostering interest in applied logic among Latin Am- ican scientists and students, and facilitating their interaction with the international - plied logic community. WoLLIC 2007 focused on foundationsof computing and programming,novel c- putation models and paradigms, broad notions of proof and belief, formal methods in software and hardware development; logical approaches to natural language and r- soning; logics of programs, actions and resources; foundational aspects of information organization, search, ?ow, sharing, and protection. The Program Committee for this meeting, consisting of the 28 colleagues listed here, was designed to promote these inter-disciplinary and cross-disciplinary topics. Like its predecessors, WoLLIC 2007 included invited talks and tutorials as well as contributed papers. The Program Committee received 52 complete submissions (aside from 15 preliminary abstracts which did not materialize). A thorough review process by the Program Committee, assisted by over 70 external reviewers, led to the acc- tance of 21 papers for presentation at the meeting and inclusion in these proceedings. The conference program also included 16 talks and tutorials by 10 prominent invited speakers, who graciously accepted the Program Committee’s invitation.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computers.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Mathematical logic.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
650 |
2 |
4 |
|a Mathematics of Computing.
|
650 |
2 |
4 |
|a Computing Methodologies.
|
650 |
2 |
4 |
|a Algorithms.
|
700 |
1 |
|
|a Leivant, Daniel.
|e editor.
|
700 |
1 |
|
|a Queiroz, Ruy de.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540734437
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 4576
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-540-73445-1
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|