| independently checkable proofs from decision procedures: issues and progress zap: automated theorem proving for software analysis decision procedures for sat, sat modulo theories and beyond the barcelogictools scaling up: computers vs. common sense a new constraint solver for 3d lattices and its application to the protein folding problem disjunctive constraint lambda calculi computational issues in exploiting dependent and-parallelism in logic programming: leftness detection in dynamic search trees the nomore++ approach to answer set solving optimizing the runtime processing of types in polymorphic logic programming languages the four sons of penrose an algorithmic account of ehrenfeucht games on labeled successor structures second-order principles in specification languages for object-oriented programs strong normalization of the dual classical sequent calculus termination of fair computations in term rewriting confluence of infinitary combinatory reduction systems matching with regular constraints recursive path orderings can also be incremental automating coherent logic the theorema environment for interactive proof development a first order extension of stmarck's method .regular derivations in basic superposition-based calculi on the finite satisfiability problem for the guarded fragment with transitivity deciding separation logic formulae by sat and incremental negative cycle elimination monotone ac-tree automata on the specification of sequent systems …… author index |
内容加载中，请稍后...
商品评论（0条）