网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 教育/科技 > 科学与研究 > 商品详情

Logic for Programming, Artificial Intelligence, and Reasoning(编程、人工智能与推理用逻辑学)

分享到:
Logic for Programming, Artificial Intelligence, and Reasoning(编程、人工智能与推理用逻辑学)

最 低 价:¥549.18

定 价:¥610.20

作 者:MosheVardi 著

出 版 社:北京燕山出版社

出版时间:2003-11-1

I S B N:3540201017

商品详情

编辑推荐

内容简介

  This book constitutes the refereed proceedings of the 10th International Conference on Logic Programming, Artificial Intelligence, and Reasoning, LPAR 2003, held in Almaty, Kazakhstan in September 2003.
  The 27 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 65 submissions. The papers address all current issues in logic programming, automated reasoning, and AI logics in particular description logics, proof theory, logic calculi, formal verification, model theory, game theory, automata, proof search, constraint systems, model checking, and proof construction.

作者简介

目录

From Tableaux to Automata for Description Logics
Disproving False Conjectures
A Formal Proof of Dickson's Lemma in ACL2
Imperative Object-Based Calculi in Co-inductive Type Theories
Congruence Closure with Integer Offsets
A Machine-Verified Code Generator
A Translation Characterizing the Constructive Content of Classical Theories
Extensions of Non-standard Inferences to Description Logics with Transitive Roles
Extended Canonicity of Certain Topological Properties of Set Spaces
Algebraic and Model Theoretic Techniques for Fusion Decidability in Modal Logics
Improving Dependency Pairs
On Closure under Complementation of Equational Tree Automata for Theories Extending AC
Completeness of E-Unification with Eager Variable Elimination
Computable Numberings
Handling Equality in Monodic Temporal Resolution
Once upon a Time in the West - Determinacy, Definability, and Complexity of Path Games
Ordered Diagnosis
Computing Preferred Answer Sets in Answer Set Programming
A Syntax-Based Approach to Reasoning about Actions and Events
Minimizing Automata on Infinite Words
Gandy's Theorem for Abstract Structures without the Equality Test
Efficient SAT Engines for Concise Logics: Accelerating Proof Search for Zero-One Linear Constraint Systems
NP-Completeness Results for Deductive Problems on Stratified Terms
Is Cantor's Theorem Automatic?
Automatic Structures of Bounded Degree
An Optimal Automata Approach to LTL Model Checking of Probabilistic Systems
A Logical Study on Qualitative Default Reasoning with Probabilities
On Structuring Proof Search for First Order Linear Logic
Strict Geometry of Interaction Granb Models
Connection-Based Proof Construction in Non-commutative Logic
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...