Logic programming and nonmonotonic reasoning : 6th international conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001 : proceedings
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science. Lecture notes in artificial intelligence
2173 |
| Matèries: | |
| Accés en línia: | 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, 6th international conference, LPNMR 2001, Vienna, Austria, September 17-19, 2001, proceedings, Thomas Eiter, Wolfgang Faber, Mirosław Truszczyński (eds.), 2001, Berlin, Springer, 1 vol. (XI-444 p.), Lecture notes in computer science, 3-540-42593-4 • Logic Programming and Nonmonotonic Reasoning, Texte imprimé, 9783662191149 |
Taula de continguts:
- Invited Papers
- A Computational Logic Approach to Heterogenous Agent Systems
- Declarative Information Extraction, Web Crawling, and Recursive Wrapping with Lixto
- On The Complexity of Model Checking and Inference in Minimal Models
- Data Integration Needs Reasoning
- Nonmonotomic Inductive Logic Programming
- Regular Papers
- Strong Equivalence for Logic Programs and Default Theories (Made Easy)
- On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
- On the Expressibility of Stable Logic Programming
- On the Relationship between Defeasible Logic and Well-Founded Semantics
- A Comparative Study of Well-Founded Semantics for Disjunctive Logic Programs
- Reasoning with Open Logic Programs
- Representation of Incomplete Knowledge by Induction of Default Theories
- Explicity Using Default Knowledge in Concept Learning: An Extended Description Logics Plus Strict and Default Rules
- Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming
- Bounded LTL Model Checking with Stable Models
- Diagnosing Physical Systems in A-Prolog
- Planning with Different Forms of Domain-Dependent Control Knowledge An Answer Set Programming Approach
- Encoding Solutions of the Frame Problem in Dynamic Logic
- ?-RES: Reasoning about Actions, Events and Observations
- Omega-Restricted Logic Programs
- Improving ASP Instantiators by Join-Ordering Methods
- Optimizing the Computation of Heuristics for Answer Set Programming Systems
- New Generation Systems for Non-monotonic Reasoning
- Algorithms for Computing X-Minimal Models
- Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
- Multi-adjoint Logic Programming with Continous Semantics
- Multi-dimensional Dynamic KnowledgeRepresentation
- Antitonic Logic Programs
- System Description
- A-system: Declarative Programming with Abduction
- An Update Front-End for Extended Logic Programs
- aspps An Implementation of Answer-Set Programming with Propositional Schemata
- NoMoRe: A System for Non-Monotonic Reasoning under Answer Set Semantics
- plp: A Generic Compiler for Ordered Logic Programs
- Prototypes for Reasoning with Infinite Stable Models and Function Symbols
- psmodels: Stable Models Based on Pertinence
- System Description: DLV
- System Description: The DLVK Planning System
- The Smodels System
- The USA-Advisor: A Case Study in Answer Set Planning.