Logic programming and nonmonotonic reasoning : 4th International Conference, LPNMR '97, Dagstuhl Castle, Germany, July 28 31, 1997 : proceedings
This book constitutes the refereed proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR '97, held in Dagstuhl Castle, Germany, in July 1997. The volume presents 19 revised regular papers together with 10 system descriptions and five abstracts of...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Körperschaft: | |
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science. Lecture notes in artificial intelligence
1265 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
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, 4th International Conference, LPNMR '97, Dagstuhl Castle, Germany, July 1997, proceedings, Jürgen Dix, Ulrich Furbach, Anil Nerode, (eds.), 1997, New York, Springer, 1 vol. (X-452 p.), Lecture notes in computer science, 3-540-63255-7 • Logic Programming and Nonmonotonic Reasoning, Texte imprimé, 9783662211472 |
Inhaltsangabe:
- Forward and backward chaining in constraint programming
- Strong and weak constraints in disjunctive datalog
- Nonmonotonic reasoning with quantified boolean constraints
- Improving the alternating fixpoint: The transformation approach
- Is non-monotonic reasoning always harder
- Complexity of only knowing: The prepositional case
- Affordable classes of normal logic programs
- Automated reasoning with nonmonotonic logics
- Simulations between programs as cellular automata
- Separating disbeliefs from beliefs in autoepistemic reasoning
- Power defaults (preliminary report)
- A study of Przymusinski's static semantics
- Resolution for skeptical stable semantics
- Computing non-ground representations of stable models
- Industry needs for integrated information services
- Computing, solving, proving: A report on the Theorema project
- Towards a systematic approach to representing knowledge in declarative logic programming
- A paraconsistent semantics with contradiction support detection
- On conservative enforced updates
- A general framework for revising nonmonotonic theories
- Composing general logic programs
- Modular logic programming and generalized quantifiers
- Programs with universally quantified embedded implications
- Generalized query answering in disjunctive deductive databases: Procedural and nonmonotonic aspects
- DisLoP: Towards a disjunctive logic programming system
- REVISE: Logic programming and diagnosis
- A deductive system for non-monotonic reasoning
- The deductive database system LOLA
- ACLP: Flexible solutions to complex problems
- Nonmonotonic reasoning in FLORID
- GLUE: Opening the world to theorem provers
- Smodels an implementation of the stable model and well-founded semantics for normal logic programs
- XSB: A system for efficientlycomputing well-founded semantics
- An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation.