partiality in logic programminginductive definitionsThis article presents some basic aspects of the proof theory of first order logic programming. We start off from general resolution, unit resolution, input resolution and SLD resolution. Then we turn to the sequent calculus and its relationship to ...
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has been established that either way of settling this conjecture would resolve open problems in complexity theory. In fact, ...
In this paper we extend the term rewriting approach to first order theorem proving, as described in Hsiang & Dershowitz 1983), to the theory of first order predicate calculus with equality. Consequently, we have showed that the term rewriting method can indeed be made to be as powerful as pa...
Recently, a two-sorted point-interval temporal logic in a modal framework in which time instants (points) and time periods (intervals) are considered on a par has been presented. We consider here two-sorted first-order languages, interpreted in the class of all linear orders, based on the ...
The...fragment of the first-order theory of atomic set constraints in ...-hard. Presents a study which described a valid formula of a fragment of the first-order theory of atomic set constraints. Details on the logic programs and set-v... Talbot,Jean-Marc - 《Information Processing Letter...
Despite this, for q 0 ( n ) we still have a kind of log-star upper bound: q 0 ( n ) ≤ 2 log n + O ( 1 ) for infinitely many n. 展开 关键词: Definability Finite graphs First order logic Turing machine simulation DOI: 10.1016/j.apal.2005.04.003 被引量: 24 ...
1、He adduced facts in support of his theory.───他列举许多事实来证实他的理论。 2、The theory that the object of external perception, in itself or as perceived, consists of ideas.───唯心主义认为一切外物无论是其本身或观察到的都存在理念的观点 3、Your proposal is all right in theory.─...
True first-order arithmetic is interpreted in the monadic theories of certain chains and topological spaces including the real line and the Cantor Discontinuum. It was known that existence of such interpretations in consistent with ZFC.doi:10.1016/0003-4843(82)90004-3Yuri Gurevich...
The theory of one-step rewriting for a given rewrite system R and signature ε is the first-order theory of the following structure: Its universe consists of all ε -ground terms, and its only predicate is the relation " x rewrites to y in one step by R ". The structure contains no ...
The theory of well quasi-orderings (Abdulla et al. 1996; Finkel and Schnoebelen 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic. 展开 年份: 2003 ...