Logic Programming and Nonmonotonic Reasoning
Editat de V. Wiktor Marek, Anil Nerode, Miroslaw Truszcynskien Limba Engleză Paperback – 7 iun 1995
The LPNMR conferences bring together researchers from logic programming and the logical foundations of artificial intelligence in order to facilitate cooperation and cross-fertilization of ideas. The 28 full papers presented define the state of the art in this interdisciplinary area of research, which has recently attracted much interest.
Preț: 384.36 lei
Puncte Express: 577
Preț estimativ în valută:
67.91€ • 78.21$ • 58.78£
67.91€ • 78.21$ • 58.78£
Carte tipărită la comandă
Livrare economică 12-26 mai
Specificații
ISBN-13: 9783540594871
ISBN-10: 3540594876
Pagini: 436
Ilustrații: IX, 415 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540594876
Pagini: 436
Ilustrații: IX, 415 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Complexity results for abductive logic programming.- A terminological interpretation of (abductive) logic programming.- Abduction over 3-valued extended logic programs.- On logical constraints in logic programming.- An operator for composing deductive data bases with theories of constraints.- Update rules in datalog programs.- Characterizations of the stable semantics by partial evaluation.- Game characterizations of logic program properties.- Computing the well-founded semantics faster.- Loop checking and the well-founded semantics.- Annotated revision specification programs.- Update by means of inference rules.- A sphere world semantics for default reasoning.- Revision by communication.- Hypothetical updates, priority and inconsistency in a logic programming language.- Situation calculus specifications for event calculus logic programs.- On the extension of logic programming with negation through uniform proofs.- Default consequence relations as a logical framework for logic programs.- Skeptical rational extensions.- Reasoning with stratified default theories.- Incremental methods for optimizing partial instantiation.- A transformation of propositional Prolog programs into classical logic.- Nonmonotonic inheritance, argumentation and logic programming.- An abductive framework for extended logic programming.- Embedding circumscriptive theories in general disjunctive programs.- Stable classes and operator pairs for disjunctive programs.- Nonmonotonicity and answer set inference.- Trans-epistemic semantics for logic programs.- Computing the acceptability semantics.