REPRESENTATION THEOREMS AND PRIMITIVE PREDICATES FOR LOGIC PROGRAMS
スポンサーリンク
概要
- 論文の詳細を見る
We present several representation theorems for logic programs in terms of formal grammatical formulation. First, for a given logic program $ P $ the notion of the success language of $ P $ is introduced, and based on this language theoretic characterization of a logic program several types of representation theorems for logic programs are provided. Main results include that there effectively exists a fixed logic program with the property that for any logic program one can find an equivalent logic program such that it can be expressed as a con junctive formula of a simple program and the fixed program. Further, by introducing the concept of an extended reverse predicate, it is shown that for any logic program there effectivily exists an equivalent logic program which can be expressed as a conjunctive formula consisting of only extended reverse programs and append programs.
- Research Association of Statistical Sciencesの論文
Research Association of Statistical Sciences | 論文
- CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
- A FAMILY OF REGRESSION MODELS HAVING PARTIALLY ADDITIVE AND MULTIPLICATIVE COVARIATE STRUCTURE
- AN OPTIMAL STOPPING PROBLEM ON TREE
- ON THE ORDERS OF MAX-MIN FUNCTIONALS
- TREE EXPRESSIONS AND THEIR PRODUCT FORMULA