We present a schematic functional programming language coupled with a logic of programs. Our language allows for μ-recursion, λ-abstraction, nondeterminism and calls to predefined functions. We define a denotational...
详细信息
In spite of the existence of a close relationship between logicprogramming and non-monotonic reasoning, in the past the two research areas have progressed largely independently of each other. Recently, however, a new...
详细信息
Nonmonotonic logics are meant to be a formalization of nonmonotonic reasoning. However, for the most part they fail to capture in a perspicuous fashion two of the most important aspects of such reasoning: the explicit...
详细信息
the proceedings contain 73 papers. the special focus in this conference is on automated Deduction. the topics include: Consistency of rule-based expert systems;a mechanizable induction principle for equational specifi...
ISBN:
(纸本)9783540193432
the proceedings contain 73 papers. the special focus in this conference is on automated Deduction. the topics include: Consistency of rule-based expert systems;a mechanizable induction principle for equational specifications;finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time;towards efficient “knowledge-based” automatedtheorem proving for non-standard logics;Propositional temporal interval logic is PSPACE complete;computational metatheory in Nuprl;type inference in Prolog;procedural interpretation of non-Horn logic programs;recursive query answering with non-Horn clauses;elements of Z-module reasoning;case inference in resolution-based languages;notes on Prolog program transformations, Prolog style, and efficient compilation to the Warren abstract machine;exploitation of parallelism in prototypical deduction problems;a decision procedure for unquantified formulas of graph theory;adventures in associative-commutative unification (A summary);unification in finite algebras is unitary(?);unification in a combination of arbitrary disjoint equational theories;partial unification for graph based equational reasoning;SATCHMO: A theorem prover implemented in Prolog;term rewriting: Some experimental results;learning and applying generalised solutions using higher order resolution;analogical reasoning and proof discovery;hyper-chaining and knowledge-based theorem proving;linear modal deductions;a resolution calculus for modal logics;solving disequations in equational theories;on word problems in Horn theories;canonical conditional rewrite systems;program synthesis by completion with dependent subtypes;reasoning about systems of linear inequalities;a subsumption algorithm based on characteristic matrices;specifying theorem provers in a higher-order logicprogramming language;a restriction of factoring in binary resolution;supposition-based logic for automated nonmonotonic reasoning;m-NEVER system summary.
We explore the effects of circumscribing first-order formulae from a computational standpoint. First, extending work of V. Lifschitz, we show that the circumscription of any existential first-order formula is equivale...
详细信息
In [12] the notion of a quantitative logic program has been introduced, and its declarative semantics explored. the operational semantics given in [12] is extended significantly in this paper — in particular, the not...
详细信息
Concurrent activities have been formally modeled by two different approaches: either by modeling shared control flow or by modeling shared data. Modeling control requires global reasoning about the ordering of shared ...
详细信息
ISBN:
(纸本)0818608013
Concurrent activities have been formally modeled by two different approaches: either by modeling shared control flow or by modeling shared data. Modeling control requires global reasoning about the ordering of shared events;transaction models only require local reasoning but are unable to capture some concurrent activities that can be modeled as communicating sequential processes. Nested objects do not suffer from either of these drawbacks. A model for nested objects is presented which is demonstrated by expressing three variations of the dining philosophers problem. It is shown how nested objects may exhibit nonserializable behavior and still be considered correct.
the proceedings contain 36 papers. the special focus in this conference is on Foundations of software Technology and theoretical Computer Science. the topics include: Computations in undistinguished networks;a distrib...
ISBN:
(纸本)9783540186250
the proceedings contain 36 papers. the special focus in this conference is on Foundations of software Technology and theoretical Computer Science. the topics include: Computations in undistinguished networks;a distributed algorithm to implement n-party rendezvous;merge and termination in process algebra;parallelism and programming: A perspective;on optimal parallelization of sorting networks;parallel algorithms for approximate edge colouring of simple graphs;an optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks: Extended abstract;an O(n2) algorithm for fan-out free query optimization;weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols;On ambiguity of DTOL systems;optimizing join queries in distributed databases;reasoning in systems of equations and inequations;specification=program+types;paraconsistent logicprogramming;semantics of distributed Horn clause programs;the calculus of constructions : State of the art;modules for re-use;hierarchical refinement of A Z specification;Lazy pattern matching in the ML language;program development using lambda abstraction;the equivalence problem for n-tape finite automata with simple cycles;relativized Arthur-Merlin versus Merlin-Arthur games;probabilistic quantifiers vs. distrustful adversaries;On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas;a look-ahead interpreter for sequential Prolog and its implementation;extension of weakest precondition formalism to a low level language;Retrospection on the PQCC compiler structure;some recent applications of knowledge;relating the degree of ambiguity of finite automata to the succinctness of their representation;automata, games, and positive monadic theories of trees.
the purpose of this paper is to present the logic-based approach to the problem of automatic verification of the different specifications of an information system. the data flow analysis method and its basic product, ...
详细信息
暂无评论