| Invited Talks Program Termination Analysis by Size-Change Graphs SET Cardholder Registration: The Secrecy Proofs Algorithms, Datastructures, and Other Issues in Efficient Automated Deduction Description, Modal, and Temporal Logics The Description Logic A~CA/'TiR+ Extended with Concrete Domains: A Practically Motivated Approach NExpTIME-Complete Description Logics with Concrete Domains Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics The Hybrid #-Calculus The Inverse Method Implements the Automata Approach for Modal Satisfiability Deduction-Based Decision Procedure for a Clausal Miniscoped Fragment of FTL Tableaux for Temporal Description Logic with Constant Domains Free-Variable Tableaux for Constant-Domain Quantified Modal Logics with Rigid and Non-rigid Designation Saturation Based Theorem Proving, Applications, Instructing Equational Set-Reasoning with Otter NP-Completeness of Refutability by Literal-Once Resolution Ordered Resolution vs. Connection Graph Resolution A Model-Based Completeness Proof of Extended Narrowing and Resolution A Resolution-Based Decision Procedure for the Two-Variable Fragment with Equality Superposition and Chaining for Totally Ordered Divisible Abelian Groups Context Trees On the Evaluation of Indexing Techniques for Theorem Proving 25 Logic Programming and Nonmonotonic Reasoning Preferred Extensions of Argumentation Frameworks: Query, Answering and Computation Bunched Logic Programming A Top-Down Procedure for Disjunctive Well-Founded Semantics A Second-Order Theorem Prover Applied to Circumscription NoMoRe: A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics 32 Propositional Satisfiabiilty and QuanfifiedBoolean Logic Logical Franeworklss Higher-Qrder Logic Interactive Theorem proving Semantic Guidence Noncassical Logics Author Index |
内容加载中，请稍后...
商品评论（0条）