| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465490403316 |
|
|
Titolo |
Logic Programming and Nonmonotonic Reasoning [[electronic resource] ] : Fourth International Conference, LPNMR'97, Dagstuhl Castle, Germany, July 28-31, 1997, Proceedings / / edited by Ulrich Furbach, Anil Nerode |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1997.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XI, 461 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Artificial Intelligence ; ; 1265 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Artificial intelligence |
Software engineering |
Architecture, Computer |
Mathematical logic |
Computer programming |
Artificial Intelligence |
Software Engineering/Programming and Operating Systems |
Computer System Implementation |
Mathematical Logic and Formal Languages |
Programming Techniques |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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 efficiently computing well-founded semantics -- An implementation platform for query-answering in default logics: The XRay system, its implementation and evaluation. |
|
|
|
|
|
|
Sommario/riassunto |
|
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 invited presentations. The papers included report state-of-the-art research and development in the interdisciplinary area of logic programming and logical foundations of artificial intelligence. |
|
|
|
|
|
|
|
| |