Übersicht			Auf mobile öffnen

Lieferstatus:	Auf Bestellung (Lieferzeit unbekannt)
Veröffentlichung:	Oktober 2002
Genre:	EDV / Informatik
	Artificial Intelligence / C / Computer architecture & logic design / Computer logic / Computer programming / software engineering / computer science / Computer Science Logic and Foundations of Programming / Computer Science, general / Computers / Logics and Meanings of Programs / Mathematical theory of computation / Operating systems / Software Engineering / Software Engineering/Programming and Operating Systems / Theory of Computation mehr...
ISBN:	9783540000105
EAN-Code:	9783540000105
Verlag:	Springer EN
Einband:	Kartoniert
Sprache:	English
Serie:	Lecture Notes in Artificial Intelligence #2514 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D
Gewicht:	1490 gr
Seiten:	470
Illustration:	XIV, 470 p.
Zus. Info:	EUDR exemption - product or manufacturing materials placed on the market prior to 31.12.2025.
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

Improving On-Demand Strategy Annotations.- First-Order Logic as a Constraint Programming Language.- Maintenance of Formal Software Developments by Stratified Verification.- A Note on Universal Measures for Weak Implicit Computational Complexity.- Extending Compositional Message Sequence Graphs.- Searching for Invariants Using Temporal Resolution.- Proof Planning for Feature Interactions: A Preliminary Report.- An Extension of BDICTL with Functional Dependencies and Components.- Binding Logic: Proofs and Models.- Directed Automated Theorem Proving.- A Framework for Splitting BDI Agents.- On the Complexity of Disjunction and Explicit Definability Properties in Some Intermediate Logics.- Using BDDs with Combinations of Theories.- On Expressive Description Logics with Composition of Roles in Number Restrictions.- Query Optimization of Disjunctive Databases with Constraints through Binding Propagation.- A Non-commutative Extension of MELL.- Procedural Semantics for Fuzzy Disjunctive Programs.- Pushdown Specifications.- Theorem Proving with Sequence Variables and Flexible Arity Symbols.- Games, Probability, and the Quantitative ?-Calculus qM?.- Parallelism and Tree Regular Constraints.- Gödel Logics and Cantor-Bendixon Analysis.- A Semantics for Proof Plans with Applications to Interactive Proof Planning.- An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction.- Proof Development with ?MEGA: ?2 Is Irrational.- A Local System for Linear Logic.- Investigating Type-Certifying Compilation with Isabelle.- Automating Type Soundness Proofs via Decision Procedures and Guided Reductions.- Abox Satisfiability Reduced to Terminological Reasoning in Expressive Description Logics.- Fuzzy Prolog: A Simple General Implementation Using (R).