Dahl / Niemelä | Logic Programming | E-Book | sack.de
E-Book

E-Book, Englisch, Band 4670, 472 Seiten, eBook

Reihe: Lecture Notes in Computer Science

Dahl / Niemelä Logic Programming

23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings

E-Book, Englisch, Band 4670, 472 Seiten, eBook

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-74610-2
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark



Dahl / Niemelä Logic Programming jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


Invited Talks.- Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs.- Preferences, Contexts and Answer Sets.- Invited Tutorials.- Answer Set Programming for the Semantic Web.- Coinductive Logic Programming and Its Applications.- Multi-paradigm Declarative Languages.- Logic Programming for Knowledge Representation.- Regular Talks.- On Finitely Recursive Programs.- Minimal Logic Programs.- Generic Tableaux for Answer Set Programming.- Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs.- Querying and Repairing Inconsistent Databases Under Three-Valued Semantics.- Logic Programming Approach to Automata-Based Decision Procedures.- A Logic Programming Framework for Combinational Circuit Synthesis.- Spatial-Yap: A Logic-Based Geographic Information System.- The Correspondence Between the Logical Algorithms Language and CHR.- Observable Confluence for Constraint Handling Rules.- Graph Transformation Systems in CHR.- Multivalued Action Languages with Constraints in CLP(FD).- Declarative Diagnosis of Temporal Concurrent Constraint Programs.- Logic Programs with Abstract Constraint Atoms: The Role of Computations.- Resource-Oriented Deadlock Analysis.- Static Region Analysis for Mercury.- Automatic Binding-Related Error Diagnosis in Logic Programs.- User-Definable Resource Bounds Analysis for Logic Programs.- Automatic Correctness Proofs for Logic Program Transformations.- Core TuLiP Logic Programming for Trust Management.- Demand-Driven Indexing of Prolog Clauses.- Design, Implementation, and Evaluation of a Dynamic Compilation Framework for the YAP System.- Declarative Debugging of Missing Answers in Constraint Functional-Logic Programming.- Tightly Integrated Probabilistic Description LogicPrograms for the Semantic Web.- View Updating Through Active Integrity Constraints.- Prosper: A Framework for Extending Prolog Applications with a Web Interface.- Web Sites Verification: An Abductive Logic Programming Tool.- Visual Logic Programming Method Based on Structural Analysis and Design Technique.- Approximating Horn Knowledge Bases in Regular Description Logics to Have PTIME Data Complexity.- A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming.- Representation and Execution of a Graph Grammar in Prolog.- On Applying Program Transformation to Implement Suspension-Based Tabling in Prolog.- Aggregates in Constraint Handling Rules.- Computing Fuzzy Answer Sets Using dlvhex.- The Use of a Logic Programming Language in the Animation of Z Specifications.- A Stronger Notion of Equivalence for Logic Programs.- A Register-Free Abstract Prolog Machine with Jumbo Instructions.- Advanced Techniques for Answer Set Programming.- A Games Semantics of ASP.- Modular Answer Set Programming.- Universal Timed Concurrent Constraint Programming.- Extension and Implementation of CHR.


Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.