標(biāo)題: Titlebook: Extensions of Logic Programming; Third International E. Lamma,P. Mello Conference proceedings 1993 Springer-Verlag Berlin Heidelberg 1993 [打印本頁] 作者: 可憐 時間: 2025-3-21 16:56
書目名稱Extensions of Logic Programming影響因子(影響力)
書目名稱Extensions of Logic Programming影響因子(影響力)學(xué)科排名
書目名稱Extensions of Logic Programming網(wǎng)絡(luò)公開度
書目名稱Extensions of Logic Programming網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Extensions of Logic Programming被引頻次
書目名稱Extensions of Logic Programming被引頻次學(xué)科排名
書目名稱Extensions of Logic Programming年度引用
書目名稱Extensions of Logic Programming年度引用學(xué)科排名
書目名稱Extensions of Logic Programming讀者反饋
書目名稱Extensions of Logic Programming讀者反饋學(xué)科排名
作者: 弄臟 時間: 2025-3-22 00:05
0302-9743 considered to enhance theexpressivepower of logic languages. Finally, some papers mainlyconcernimplementation techniques for some of these logicprogramming extensions.978-3-540-56454-6978-3-540-47562-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 吸引力 時間: 2025-3-22 03:20 作者: 無聊點好 時間: 2025-3-22 05:22
SooWhan Choi,Sadik Amajjahe,Helmut Ritteras constraints, first reduced to a canonical form through a suitable canonization algorithm). Finally, the application of the resulting language to the definition of Restricted Universal Quantifiers is discussed.作者: 植物群 時間: 2025-3-22 12:45 作者: ordain 時間: 2025-3-22 14:44
‘Race’ and the Discourse on ‘Inclusion’ execution. Our concern here is largely with the dynamic aspects of module interaction. We describe a method for compiling each module into an independent fragment of code. Static interactions prevent the compilation of interacting modules from being completely decoupled. However, using the idea of 作者: ordain 時間: 2025-3-22 18:58 作者: nullify 時間: 2025-3-22 23:19 作者: Generic-Drug 時間: 2025-3-23 02:59
,The π-calculus as a theory in linear logic: Preliminary results,ory of the π-calculus. We present some preliminary results along this line for π., the “propositional” fragment of the π-calculus, which lacks restriction and value passing (π. is a subset of CCS). Using ideas from proof-theory, we introduce . and show that they can specify some testing equivalences作者: etidronate 時間: 2025-3-23 07:00 作者: 條街道往前推 時間: 2025-3-23 12:24 作者: Facilities 時間: 2025-3-23 15:26 作者: 微粒 時間: 2025-3-23 20:00
Kate L. Anderson,Susan Balandinnd so more elaborate approaches to the implementation are necessary. In this article we describe an architecture of a Prolog system that gives the user enough support to quickly prototype new extensions and at the same time to implement them efficiently and incrementally. This architecture has been used to build the . and .. systems.作者: Substance-Abuse 時間: 2025-3-23 22:42
A Correct goal-directed proof procedure for a general logic program with integrity constraints,re is an extension of Eshghi‘s procedure [3] which is correct for every call-consistent logic program, and can be regarded as a combination of the model elimination procedure [10] and consistency checking in updates of implicit deletions [14].作者: ferment 時間: 2025-3-24 06:13 作者: 大量殺死 時間: 2025-3-24 06:45
An architecture for Prolog extensions,nd so more elaborate approaches to the implementation are necessary. In this article we describe an architecture of a Prolog system that gives the user enough support to quickly prototype new extensions and at the same time to implement them efficiently and incrementally. This architecture has been used to build the . and .. systems.作者: LEERY 時間: 2025-3-24 11:19 作者: Monotonous 時間: 2025-3-24 15:44
Conditional narrowing with constructive negation,ne the notion of . and . of a normal theory. We show that there exists one minimal model for the completion of a stratified normal theory. Then we prove the correctness of the operational semantics with respect to the . of a . normal theory.作者: 感情脆弱 時間: 2025-3-24 19:34 作者: mastopexy 時間: 2025-3-25 00:58
Techniques for implementing contexts in Logic Programming,tion into Prolog code and compilation on an extended Warren Abstract Machine. These approaches are compared from the point of view of both methodology and efficiency. In the last part of the paper we consider a more effective implementation, developed on an industrial Prolog enhanced with the module construct.作者: 臆斷 時間: 2025-3-25 04:28
Zeolite Encapsulated Metal Complexes,tions in LIFE declaralively as solving partial information constraints. These constraints do not attempt to generate their solutions but behave as demons filtering out anything else. In this manner, LIFE functions act as declarative coroutines.作者: 真實的你 時間: 2025-3-25 08:52 作者: 宇宙你 時間: 2025-3-25 13:26 作者: 蝕刻 時間: 2025-3-25 16:51
https://doi.org/10.1007/978-94-6351-065-3entations for more expressive logic programming languages. Also, ANF proofs are readily understood as formal counterparts of informal (but rigorous) arguments constructed by humans. Powerful explanation, debugging and control facilities can be based on this correspondence.作者: malapropism 時間: 2025-3-25 23:05 作者: Nomadic 時間: 2025-3-26 03:55 作者: 失望未來 時間: 2025-3-26 07:56 作者: 不容置疑 時間: 2025-3-26 09:38 作者: GROG 時間: 2025-3-26 15:42 作者: 發(fā)源 時間: 2025-3-26 18:07 作者: lanugo 時間: 2025-3-26 21:02
Inclusion Aspects of Membrane Chemistryne the notion of . and . of a normal theory. We show that there exists one minimal model for the completion of a stratified normal theory. Then we prove the correctness of the operational semantics with respect to the . of a . normal theory.作者: RAG 時間: 2025-3-27 04:08
https://doi.org/10.1007/978-1-0716-2930-7transaction. The semantics of this language is given in two steps and is based on a notion of observable corresponding to the computed answer constraint. Moreover, some useful notions of equivalence between databases with respect to a transaction and between transactions with respect to a database are given.作者: 進入 時間: 2025-3-27 05:34
Wendy Holcombe,Margaret Plunketttion into Prolog code and compilation on an extended Warren Abstract Machine. These approaches are compared from the point of view of both methodology and efficiency. In the last part of the paper we consider a more effective implementation, developed on an industrial Prolog enhanced with the module construct.作者: 財政 時間: 2025-3-27 10:41 作者: Insulin 時間: 2025-3-27 14:01
Conference proceedings 1993oted topapers concentrating on proof theoryand inspired byGentzen-style sequent or natural deduction systems. Topicssuch as concurrency are considered to enhance theexpressivepower of logic languages. Finally, some papers mainlyconcernimplementation techniques for some of these logicprogramming extensions.作者: DUST 時間: 2025-3-27 21:37 作者: regale 時間: 2025-3-27 23:22
https://doi.org/10.1007/978-3-030-11401-5programming interpretation” of (the proofs of) linear logic, adding to the concurrency and functional programming interpretations that are already known. It also brings logic programming into the broader world of typed languages and types-as-propositions paradigm, enriching it with static scoping and higher-order features.作者: aerial 時間: 2025-3-28 03:26
A modal framework for structured logic programs,locks within a single language, the modal language. The main aim of this paper is to study the operational semantics of the language which integrates different kinds of blocks, to investigate how it can be used (and further extended) and to see how it compares to other logical languages proposed for dealing with blocks and modules.作者: 憤憤不平 時間: 2025-3-28 06:27
A typed foundation for directional logic programming,programming interpretation” of (the proofs of) linear logic, adding to the concurrency and functional programming interpretations that are already known. It also brings logic programming into the broader world of typed languages and types-as-propositions paradigm, enriching it with static scoping and higher-order features.作者: 問到了燒瓶 時間: 2025-3-28 11:47 作者: 使人煩燥 時間: 2025-3-28 16:33
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作者: 不合 時間: 2025-3-28 20:05
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 時間: 2025-3-29 01:41 作者: Longitude 時間: 2025-3-29 06:00
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作者: 易于 時間: 2025-3-29 08:53
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作者: 自作多情 時間: 2025-3-29 13:04
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作者: 苦惱 時間: 2025-3-29 18:44
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作者: 防止 時間: 2025-3-29 22:26
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 時間: 2025-3-30 03:43
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作者: 事與愿違 時間: 2025-3-30 07:32
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.作者: Loathe 時間: 2025-3-30 08:27
The abstract scheme for concurrent programming,ate transformations that may occur. The activity of a system is driven by goals (actions) organized in parallel and sequence in a structure called the agenda. Actions in the agenda communicate and synchronize by atomically consulting and updating a global shared space, the blackboard, which may, in 作者: FEMUR 時間: 2025-3-30 15:44
,The π-calculus as a theory in linear logic: Preliminary results,calculus (unlabeled) reduction is identified with “entailedby”. Under this translation, parallel composition is mapped to the multiplicative disjunct (“par”) and restriction is mapped to universal quantification. Prefixing, non-deterministic choice (+), replication (!), and the match guard are all r作者: BOGUS 時間: 2025-3-30 18:36
Natural deduction proof theory for logic programming,owever, distance them from the Horn language required by SLD resolution. We propose a direct proof theoretic account for logic programming. The derivations built by the inference engine are not refutations, but direct proofs of the query from the program formulae as premisses. Derivations correspond作者: PANG 時間: 2025-3-30 23:24 作者: 先兆 時間: 2025-3-31 04:28 作者: 進入 時間: 2025-3-31 05:05
Techniques for implementing contexts in Logic Programming, in particular, is based on Contextual Logic Programming. Three different implementation approaches are considered first: meta-interpretation, translation into Prolog code and compilation on an extended Warren Abstract Machine. These approaches are compared from the point of view of both methodology作者: anesthesia 時間: 2025-3-31 11:20 作者: 背叛者 時間: 2025-3-31 16:56
978-3-540-56454-6Springer-Verlag Berlin Heidelberg 1993作者: Intend 時間: 2025-3-31 20:13 作者: 鞠躬 時間: 2025-3-31 22:19
https://doi.org/10.1007/3-540-56454-3Constraint; Extension; Natural; Turing; abductive reasoning; artificial intelligence; functional programmi
