|
|
|
|
| LEADER |
00000nam a22000005i 4500 |
| 001 |
978-3-540-36636-2 |
| 003 |
DE-He213 |
| 005 |
20220311223052.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2006 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783540366362
|9 978-3-540-36636-2
|
| 024 |
7 |
|
|a 10.1007/11799573
|2 doi
|
| 050 |
|
4 |
|a QA76.758
|
| 072 |
|
7 |
|a UMZ
|2 bicssc
|
| 072 |
|
7 |
|a COM051230
|2 bisacsh
|
| 072 |
|
7 |
|a UMZ
|2 thema
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
0 |
|a Logic Programming
|h [electronic resource] :
|b 22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings /
|c edited by Sandro Etalle, Miroslav Truszczynski.
|
| 250 |
|
|
|a 1st ed. 2006.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2006.
|
| 300 |
|
|
|a XIV, 474 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 Programming and Software Engineering,
|x 2945-9168 ;
|v 4079
|
| 505 |
0 |
|
|a Invited Talks -- Why Use Datalog to Analyze Programs? -- Semantic Web: The Story of the RIFt so Far -- Invited Tutorial -- Overcoming Performance Barriers: Efficient Verification Techniques for Logical Frameworks -- Regular Talks Theory -- Tableau Calculi for Answer Set Programming -- Declarative Semantics of Production Rules for Integrity Maintenance -- Modules for Prolog Revisited -- A Local Algorithm for Incremental Evaluation of Tabled Logic Programs -- Functional and Constraint Logic Programming -- Memory Reuse for CHR -- Overlapping Rules and Logic Variables in Functional Logic Programs -- Towards "Propagation = Logic + Control" -- ACD Term Rewriting -- Program Analysis -- Detecting Determinacy in Prolog Programs -- Collapsing Closures -- Reduced Certificates for Abstraction-Carrying Code -- Proving Properties of Constraint Logic Programs by Eliminating Existential Variables -- Answer-Set Programming -- Justifications for Logic Programs Under Answer Set Semantics -- Generality Relations in Answer Set Programming -- Cooperating Answer Set Programming -- Predicate Introduction Under Stable and Well-Founded Semantics -- Special Interest Paper -- Improving the ISO Prolog Standard by Analyzing Compliance Test Results -- Applications I -- TOAST: Applying Answer Set Programming to Superoptimisation -- Modelling Biological Networks by Action Languages Via Answer Set Programming -- Using Answer Set Programming for the Automatic Compilation of Assessment Tests -- Semantics -- Compositional Semantics for the Procedural Interpretation of Logic -- Coinductive Logic Programming -- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic -- The Semantics of Nominal Logic Programs -- Applications II -- Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming -- Deductive Spreadsheets Using Tabled Logic Programming -- Using a Logic Programming Framework to Control Database Query Dialogues in Natural Language -- Poster Presentations -- Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming -- Solving First-Order Constraints in the Theory of the Evaluated Trees -- Relaxation on Optimization Predicates -- Handling Incomplete and Complete Tables in Tabled Logic Programs -- An External Module for Implementing Linear Tabling in Prolog -- Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation -- Towards Region-Based Memory Management for Mercury Programs -- Towards Structured Contexts and Modules -- Towards Temporal Contextual Logic Programming -- Semantic Property Grammars for Knowledge Extraction from Biomedical Text -- Natural Language Processing Using Lexical and Logical Combinators -- Learning Semantic Parsers: A Constraint Handling Rule Approach -- A Declarative Framework for Security: Secure Concurrent Constraint Programming -- Logic Programming in Knowledge Domains -- Logtalk Processing of STEP Part 21 Files -- Integrating Datalog with OWL: Exploring the AL-log Approach -- LMNtal as a Unifying Declarative Language: Live Demonstration -- Doctoral Consortium Presentations -- Declarative Problem Solving Using Answer Set Semantics -- The Design and Implementation of the YAP Compiler: An Optimizing Compiler for Logic Programming Languages -- Description Logic Reasoning in Prolog -- Static Memory Management for Logic Programming Languages -- Deductive Databases: Implementation, Parallelism and Applications -- Efficient Reasoning About Action and Change in the Presence of Incomplete Information and Its Application in Planning -- Deducing Logic Programs.
|
| 650 |
|
0 |
|a Software engineering.
|
| 650 |
|
0 |
|a Computer programming.
|
| 650 |
|
0 |
|a Artificial intelligence.
|
| 650 |
|
0 |
|a Compilers (Computer programs).
|
| 650 |
|
0 |
|a Computer science.
|
| 650 |
|
0 |
|a Machine theory.
|
| 650 |
1 |
4 |
|a Software Engineering.
|
| 650 |
2 |
4 |
|a Programming Techniques.
|
| 650 |
2 |
4 |
|a Artificial Intelligence.
|
| 650 |
2 |
4 |
|a Compilers and Interpreters.
|
| 650 |
2 |
4 |
|a Computer Science Logic and Foundations of Programming.
|
| 650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
| 700 |
1 |
|
|a Etalle, Sandro.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 700 |
1 |
|
|a Truszczynski, Miroslav.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer Nature eBook
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540826835
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783540366355
|
| 830 |
|
0 |
|a Programming and Software Engineering,
|x 2945-9168 ;
|v 4079
|
| 856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11799573
|z Texto Completo
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-SXCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (SpringerNature-11645)
|
| 950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|
