Titlebook: Extensions of Logic Programming; Third International E. Lamma,P. Mello Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993

使人煩燥

A Correct goal-directed proof procedure for a general logic program with integrity constraints, correct bottom-up procedures for every general logic program [13, 4, 15, 7] to compute stable models, there are no proposed correct goal-directed procedure for every general logic program. Our proposed procedure is correct not only for successful derivation but also for finite failure. This procedu

不合

Declarative semantics of hypothetical logic programming with negation as failure, of two steps: (i) Updating the context by inserting the clauses in R into it, and (ii) Resolving the goal G wrt the new context P U R. The consequence of viewing the assumptions R in a hypothetical goal (G ∶ R) as an update request imposes a kind of update semantics on the semantics of P. We study

TAP

Longitude

as a deductive database language with updates,work to be used for deductive database language with updates. .. can be seen as an extension of Datalog with base relations updates and the notion of transaction. The semantics of this language is given in two steps and is based on a notion of observable corresponding to the computed answer constrai

易于

Logic programming with functions over order-sorted feature terms,laces first-order terms with .-terms, data structures which allow computing with partial information. These arc approximation structures denoting sets of values. LIFE further enriches the expressiveness of .-terms with functional dependency constraints. Whereas LIFE‘s relations defined as Horn-claus

自作多情

A direct semantic characterization of RELFUN,neralized model concept. Function-defining conditional equations (or, footed clauses) and active call-by-value expressions (in clause premises) are integrated into first-order theories. Herbrand models are accomodated to relational-functional programs by not only containing ground atoms but also gro

苦惱

Embedding finite sets in a logic programming language,d from both the declarative and the operational semantics viewpoint First, special set terms are added to definite Horn clause logic and an extended Herbrand Universe based on an axiomatic characterization of the kind of sets we are dealing with is defined accordingly. Moreover, distinguished predic

防止

A modal framework for structured logic programs,dal characterization can be given to different languages which are obtained by extending Horn clause logic with implication goals D=>G (where G is a goal and D is a set of local clauses). Implication goals can be regarded as blocks of conventional programming languages and such an extension provides

MANIA

Metalogic for state oriented programming,tems. Both of them rely upon the ability of maintaining either a distributed or a centralised state. On the other hand, logic programming has proven to be one of the most sophisticated and semantically well defined paradigms for declarative programming. We show how logic programming and state manage

事與愿違

On the semantics of inheritance in logic programming: Compositionality and full abstraction, when inheritance is assumed as the underlying composition mechanism. The analysis is carried out along the guidelines of [7] and leads us to conclude that a logical semantics is inherently inadequate to fully capture the computational aspects of program composition. by inheritance.