A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We can now define the notions of term-rewriting systems, reduction, and normal form. EXTENDED UNIFICATION ALGORITHMS 203 Dejkition 5. ... We will define two strategies for this purpose: innermost and outermost. .An equivalent characterization of confluence is the so-called Church-Rosser property  . ... D Extended unification algorithms are considered for the integration of a functional language into a logic programming language. ...doi:10.1016/0743-1066(87)90002-1 fatcat:62tfw5gz75fglc4ij3acev4bwq
The main methods to extend functional programs with logic features (i.e. unification) are then considered. ... Extending the Power of Functional Languages There are a number of proposals for adding unification to pattern-matching functional languages, with the aim of partially achieving some typical logic-programming ... solutions can be reasonably expected only for specific subclasses of higher-order functional programs. This is therefore still an open research problem. ...doi:10.1016/0743-1066(86)90014-2 fatcat:kzu7tvyz2fajvlsl767fgczjfe
The fact that there is alaays at most one mgu, i.e. the theory of boolean expressions is unitary, is of particular importance for lbe embedding of the data type 'boolean ,..xpression' into logic programming ... Thus PROLOG can be used as a theorem prover for propositional logic. In particular, negation can be treated within logic instead of negation by failure. ... While some parts of the algorithm are still open to improvements, the prototype shows the feasibi]ity of integrating boolean expressions into logic programming. ...doi:10.1016/s0747-7171(87)80065-2 fatcat:tkzobln55bejfe6p4pqimyuo6u
In this paper we elaborate on a specific application in the context of hybrid description logic programs (hybrid DLPs), namely description logic Semantic Web type systems (DL-types) which are used for ... term typing of LP rules based on a polymorphic, order-sorted, hybrid DL-typed unification as procedural semantics of hybrid DLPs. ... The standard untyped unification algorithm in logic programming serves as a tool for the resolution principle. ...arXiv:cs/0610006v2 fatcat:szfxxjpbvzej5jq6mjgbrgnmka
Accordingly, we present 2P-Kt, a reboot of the tuProlog project offering a general, extensible, and interoperable ecosystem for logic programming and symbolic AI. ... Instead, to maximise their impact, logic-based technologies should support and enable the general-purpose exploitation of all the manifold contributions from logic programming. ... The authors would like to thank Enrico Siboni for his contribution in the early phases of 2P-Kt development. ...doi:10.1016/j.softx.2021.100817 fatcat:vgsu5pd7rrghhiizxo5rgmciom
Residuation is an operational mechanism for the integration of functions into logic programming languages. ... , this function can never be evaluated, and some answers which are logical consequences of the program are lost. ... D Residuation is an operational mechanism for the integration of functions into logic programming languages. ...doi:10.1016/0743-1066(94)00105-f fatcat:cn3fqmck4rf35kquvsxcygzbki
Lecture Notes in Computer Science
In this ca~e each instance of the type declaration can be used in the logic program. Secondly, types are related by subset inclusions. ... This paper proposes a type system for logic programming where types are structured in two .ways. ... A semantically clean integration of such features into logic programming needs a unification procedure on lambda expressions. ...doi:10.1007/3540539816_67 fatcat:aw64wrabq5bfpmsqs4rijb6zri
FASILL integrates and extends features coming from MALP (Multi-Adjoint Logic Programming, a fuzzy logic language with explicitly annotated rules) and Bousi~Prolog (which uses a weak unification algorithm ... FASILL (acronym of "Fuzzy Aggregators and Similarity Into a Logic Language") is a fuzzy logic programming language with implicit/explicit truth degree annotations, a great variety of connectives and unification ... The first line of integration, where the syntactic unification algorithm is extended with the ability of managing similarity/proximity relations, is of special relevance for this work. ...doi:10.4204/eptcs.173.6 fatcat:b6zucsg3sbctrbhouvku2p4bri
The semantic foundations for logic programming are usually separated into two different approaches. ... For this we define a new typed unification algorithm. Finally we prove the correctness of TSLD-resolution with respect to a typed declarative semantics. ... Here we will extend a previous unification algorithm [MM82] to define a typed unification algorithm, where failure will be separated into f alse, where two terms are not unifiable but may have the same ...arXiv:2208.00192v1 fatcat:5ikk7hxakzhk3jeurwbod5utom
On the other hand, functional programs can be equipped with the power of logic programming languages, e.g., Prolog. ... It is shown that this evaluation mechanism works well for both functional programs and logic programs that involve "executable" functions. ... mechanism for integrating functions and logic. ...doi:10.1145/800017.800534 dblp:conf/popl/SubrahmanyamY84 fatcat:wsdkv4wnafgkhkwctcr5n2epeu
Diagrammatic Representation and Reasoning
The paper presents constraint-based extensions of picture logic which render it suitable for the specification of such diagram notations and the required transformations. ... This paper discusses picture logic, a visual language for the specification of diagrams and diagram transformations. ... During the time of writing the author was visiting the University of Colorado at Boulder supported by DFG Grant MEll/94. ...doi:10.1007/978-1-4471-0109-3_15 fatcat:2667dsfx2rds3cep3tv7kki4ju
Lipeck, Transformation of dynamic integrity constraints into transaction specifications (pp. 115-142); Guozhu Dong and Seymour Gins- burg, On the decomposition of datalog program mappings (pp. 143-177) ... Payne, Case-free programs: An abstraction of definite Horn programs (pp. 87-101); Chitta Baral, Jorge Lobo and Jack Minker, Generalized well-founded semantics for logic programs (extended abstract) (pp ...
As an overriding of our symbolic indexing algorithm, the same function can be delegated to a neural network, serving ground facts to Natlog's resolution engine. ... We introduce Natlog, a lightweight Logic Programming language, sharing Prolog's unification-driven execution model, but with a simplified syntax and semantics. ... Introduction With renewed interest in neuro-symbolic AI [8, 10, 7, 2] , integration of logic programming languages into deep-learning ecosystems is becoming of paramount importance. ...doi:10.4204/eptcs.345.27 fatcat:g6rl267yanhrnplstjxihs3q34
of the query and the integrity constraints are implied by the extended set of definitions. ... of F -unification for recursive functions. ...
Our approach is to investigate knowledge base systems from the viewpoint of logic programming. ... One is a model combining a logic programming system and a database management software system. The other is an integrated model. ... The author wishes to thank the members of the KBM working group and the people in industry who participated in joint research programs for their helpful discussions. The author also thanks Drs. ...dblp:conf/vldb/Itoh86 fatcat:ou5vdxwrvrhf7jye3fhy5jdofa
« Previous Showing results 1 — 15 out of 9,498 results