Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings / / edited by Vladimir Lifschitz, Ilkka Niemelä

• Record Nr.: UNISA996466048103316
• Pubbl/distr/stampa: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004
• ISBN: 9786610307975; 3-540-24609-6
• Edizione: [1st ed. 2004.]
• Descrizione fisica: 1 online resource (X, 370 p.)
• Collana: Lecture Notes in Artificial Intelligence ; ; 2923
• Disciplina: 005.1/15
• Soggetti: Software engineering; Artificial intelligence; Computer programming; Mathematical logic; Software Engineering/Programming and Operating Systems; Artificial Intelligence; Programming Techniques; Mathematical Logic and Formal Languages
• Lingua di pubblicazione: Inglese
• Formato: Materiale a stampa
• Livello bibliografico: Monografia
• Note generali: Bibliographic Level Mode of Issuance: Monograph
• Nota di bibliografia: Includes bibliographical references at the end of each chapters and index.
• Nota di contenuto: Invited Papers -- Constraints and Probabilistic Networks: A Look At The Interface -- Toward A Universal Inference Engine -- Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative -- Regular Papers -- Semantics for Dynamic Logic Programming: A Principle-Based Approach -- Probabilistic Reasoning With Answer Sets -- Answer Sets: From Constraint Programming Towards Qualitative Optimization -- A Logic of Non-monotone Inductive Definitions and Its Modularity Properties -- Reasoning About Actions and Change in Answer Set Programming -- Almost Definite Causal Theories -- Simplifying Logic Programs Under Uniform and Strong Equivalence -- Towards Automated Integration of Guess and ; Check Programs in Answer Set Programming -- Towards Automated Integration of Guess and Check Programs in Answer Set Programming -- Graphs and Colorings for Answer Set Programming: Abridged Report -- Nondefinite vs. Definite Causal Theories -- Logic Programs With Monotone Cardinality Atoms -- Set Constraints in Logic Programming -- Verifying the Equivalence of Logic Programs in the Disjunctive Case -- Uniform Equivalence for Equilibrium Logic and Logic Programs -- Partial Stable Models for Logic Programs with Aggregates -- Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs -- Using Criticalities as a Heuristic for Answer Set Programming -- Planning with Preferences Using Logic Programming -- Planning with Sensing Actions and Incomplete Information Using Logic Programming -- Deduction in Ontologies via ASP -- Strong Equivalence for Causal Theories -- Answer Set Programming with Clause Learning -- Properties of Iterated Multiple Belief Revision -- System Descriptions -- System Description: DLV with Aggregates -- GNT — A Solver for Disjunctive Logic Programs -- LPEQ and DLPEQ — Translators for Automated Equivalence Testing of Logic Programs -- DLV DB : Bridging the Gap between ASP Systems and DBMSs -- Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs -- WSAT(CC) — A Fast Local-Search ASP Solver -- Smodels with CLP—A Treatment of Aggregates in ASP -- nlp: A Compiler for Nested Logic Programming.