Logic programming and nonmonotonic reasoning : 7th international conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004 : proceedings
Gardado en:
| Autor Corporativo: | |
|---|---|
| Outros autores: | , |
| Formato: | Livre numérique |
| Idioma: | Anglais |
| Publicado: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Series: | Lecture notes in computer science. Lecture notes in artificial intelligence
2923 |
| Sujets: | |
| Acceso en liña: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic programming and nonmonotonic reasoning, 7th international conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, proceedings, Vladimir Lifschitz, Ilkka Niemelä (eds.), Berlin, Springer, 2004, 1 vol. (IX-364 p.), Lecture notes in computer science, 3-540-20721-X • Logic Programming and Nonmonotonic Reasoning, Texte imprimé, 9783662171288 |
Table des matières:
- 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.