| 000 | 06023nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-36636-2 | ||
| 003 | DE-He213 | ||
| 005 | 20240730195528.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2006 gw | s |||| 0|eng d | ||
| 020 |
_a9783540366362 _9978-3-540-36636-2 |
||
| 024 | 7 |
_a10.1007/11799573 _2doi |
|
| 050 | 4 | _aQA76.758 | |
| 072 | 7 |
_aUMZ _2bicssc |
|
| 072 | 7 |
_aCOM051230 _2bisacsh |
|
| 072 | 7 |
_aUMZ _2thema |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 245 | 1 | 0 |
_aLogic Programming _h[electronic resource] : _b22nd International Conference, ICLP 2006, Seattle, WA, USA, August 17-20, 2006, Proceedings / _cedited by Sandro Etalle, Miroslav Truszczynski. |
| 250 | _a1st ed. 2006. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2006. |
|
| 300 |
_aXIV, 474 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aProgramming and Software Engineering, _x2945-9168 ; _v4079 |
|
| 505 | 0 | _aInvited 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 SetProgramming -- 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 |
_aSoftware engineering. _94138 |
|
| 650 | 0 |
_aComputer programming. _94169 |
|
| 650 | 0 |
_aArtificial intelligence. _93407 |
|
| 650 | 0 |
_aCompilers (Computer programs). _93350 |
|
| 650 | 0 |
_aComputer science. _99832 |
|
| 650 | 0 |
_aMachine theory. _9160530 |
|
| 650 | 1 | 4 |
_aSoftware Engineering. _94138 |
| 650 | 2 | 4 |
_aProgramming Techniques. _9160531 |
| 650 | 2 | 4 |
_aArtificial Intelligence. _93407 |
| 650 | 2 | 4 |
_aCompilers and Interpreters. _931853 |
| 650 | 2 | 4 |
_aComputer Science Logic and Foundations of Programming. _942203 |
| 650 | 2 | 4 |
_aFormal Languages and Automata Theory. _9160532 |
| 700 | 1 |
_aEtalle, Sandro. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160533 |
|
| 700 | 1 |
_aTruszczynski, Miroslav. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9160534 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9160535 |
|
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540366355 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540826835 |
| 830 | 0 |
_aProgramming and Software Engineering, _x2945-9168 ; _v4079 _9160536 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/11799573 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cELN | ||
| 999 |
_c95664 _d95664 |
||