Sequence Domains and Fixpoint Semantics for Logic Programs
スポンサーリンク
概要
- 論文の詳細を見る
There have been semantics for logic programs as sets of definite clauses over sequence domains in [2], [6]. The sequence of substitutions caused by resolutions for logic programs can be captured by a fixpoint of a functional [3], [16]. In [15], a functional is regarded as a behaviour of a dataflow network, the semantics over sequence domains induces dataflow computing for logic programs. Also it may provide a transformation of logic programs to functional programs [16]. Motivated by dataflow computing constructions for logic programming, this paper deals with fixpoint semantics over sequence domains for logic programs with equations and negations. A transformation, representing deductions caused by resolutions and narrowings, is associated with a logic program with equations, modified from the operator in [18], so that it may be represented by a continuous functional over a sequence domain, and its least fixpoint is well-defined. An explicit construction of such a continuous functional of sequence variables is necessary for dataflow computing, and we should prove that the functional of sequence variables can exactly represent the transformation concerned with sets. For a general logic program, a functional is constructed over a sequence domain so that it may reflect a consistency-preserving renewal function for the pair of atom sets on the basis of the 3-valued logic approach as in [7], and [11]. It is a problem to construct the domain for the functional representing a generation of atom sets interpreted as true and negation as failure in the generation, for general logic programs. The functional is monotonic over a complete partial order and its least fixpoint is well-defined, although the least fixpoint is not always obtained by the limit of finite computing, because of the functional being not necessarily continuous.
- 社団法人電子情報通信学会の論文
- 1996-06-25
著者
-
Yamasaki Susumu
Department Of Computing And Information Technology Okayama University
-
Yamasaki Susumu
Department Of Computing And Information Technology The Faculty Of Engineering Okayama University
関連論文
- A solid pseudopapillary tumor arising from the greater omentum followed by multiple metastases with increasing malignant potential
- Effect of Heavy Alcohol Intake on Long-term Results after Curative Resection of Hepatitis C Virus-related Hepatocellular Carcinoma
- Localized Nodular Idiopathic Retroperitoneal Fibrosis : Successful Treatment with Surgical Resection
- A Prospective Randomized Trial of the Preventive Effect of Pre-operative Transcatheter Arterial Embolization against Recurrence of Hepatocellular Carcinoma
- Negation as Failure through a Network(Computation and Computational Models)
- Semantics of Normal Goals as Acquisitors Caused by Negation as Failure
- A Combination of SLDNF Resolution with Narrowing for General Logic Programs with Equations with Respect to Extended Well-Founded Model
- Control Problem of a Class of Pushdown Automata Based on Posets and Its Application to Resolution Deductions
- Curative resection of hepatocellular carcinoma with intrabile duct tumor growth mimicking hilar bile duct carcinoma
- Shearing of Inclined Sheet Metals : Effect of Inclination Angle
- Intrahepatic cholangiocarcinoma : macroscopic type and stage classification
- Sequence Domains and Fixpoint Semantics for Logic Programs
- CASE REPORT OF SPLENIC ANEURYSM