Completeness of Dynamic Time-Bounded Derivation for Locally Weak Reducing Programs
スポンサーリンク
概要
- 論文の詳細を見る
In the logic programming, it is generally undecidable, whether or not a formula isdeducible from a program. In this paper, we discuss the relations between structureof programs and termination of derivations, and show that the predicate symbols in aprogram can be classified and stratified by a relation between them. We propose twoclasses of logic programs called locally weak reducing and locally reducing programs.We also give a new dynamic time-bounded derivation procedure, and prove thecompleteness of this procedure for locally weak reducing programs.
- Research Association of Statistical Sciencesの論文
- 1990-08-22
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