Results 221 to 230 of about 26,189 (263)
Some of the next articles are maybe not open access.
Differential logic programming
Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93, 1993In this paper we define a compositional semantics for a generalized composition operator on logic programs. Static and dynamic inheritance as well as composition by union of clauses can all be obtained by specializing the general operator. The semantics is based on the notion of differential programs, logic programs annotated with declarations that ...
Bossi Annalisa +4 more
openaire +2 more sources
ACM Transactions on Programming Languages and Systems, 1994
Modularity is a key issue in the design of modern programming languages. When designing modular features for declarative languages in general, and for logic programming languages in particular, the challenge lies in avoiding the superimposition of a complex syntactic and semantic structure over the simple structure of the basic language.
BROGI, ANTONIO +3 more
openaire +2 more sources
Modularity is a key issue in the design of modern programming languages. When designing modular features for declarative languages in general, and for logic programming languages in particular, the challenge lies in avoiding the superimposition of a complex syntactic and semantic structure over the simple structure of the basic language.
BROGI, ANTONIO +3 more
openaire +2 more sources
Logic Programming and Default Logic
International Journal on Artificial Intelligence Tools, 1994We present several ideas of increasing complexity how to translate default theories to normal logic programs that make direct use of the deductive capacity of logic programming. We show the limitations of simple, ad hoc approaches, and arrive at a more general construction; its main property is that the answer substitutions computed by the logic ...
openaire +1 more source
International Journal of Intelligent Systems, 1986
Summary: This article describes a support logic programming system which uses a theory of support pairs to model various forms of uncertainty. It should find application to designing expert systems and is of a query language type like Prolog. Uncertainty associated with facts and rules is represented by a pair of supports and uses ideas from Zadeh's ...
openaire +2 more sources
Summary: This article describes a support logic programming system which uses a theory of support pairs to model various forms of uncertainty. It should find application to designing expert systems and is of a query language type like Prolog. Uncertainty associated with facts and rules is represented by a pair of supports and uses ideas from Zadeh's ...
openaire +2 more sources
ACM SIGMOD Record, 1990
An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates.
Laenens E., SACCA', Domenico, Vermeir D.
openaire +3 more sources
An extension of logic programming, called “ordered logic programming”, which includes some abstractions of the object-oriented paradigm, is presented. An ordered program consists of a number of modules (objects), where each module is composed by a number of rules possibly with negated head predicates.
Laenens E., SACCA', Domenico, Vermeir D.
openaire +3 more sources
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
Studia Logica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damásio, Carlos Viegas +1 more
openaire +2 more sources
Fundamenta Informaticae, 1992
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +2 more sources
Starting from a general dynamic analysis of reasoning and programming, we develop two main dynamic perspectives upon logic programming. First, the standard fixed point semantics for Horn clause programs naturally supports imperative programming styles.
openaire +2 more sources
Journal of Logic and Computation, 1993
Summary: Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues in representing knowledge with logic. On the one hand, evolving knowledge in logic programming can be modelled through suitable operators for the dynamic composition of separate programs. On the other hand, when dealing with dynamic compositions
BROGI, ANTONIO, E. Lamma, P. Mello
openaire +3 more sources
Summary: Structuring logic programs to deal with evolving and incomplete knowledge is one of the main issues in representing knowledge with logic. On the one hand, evolving knowledge in logic programming can be modelled through suitable operators for the dynamic composition of separate programs. On the other hand, when dealing with dynamic compositions
BROGI, ANTONIO, E. Lamma, P. Mello
openaire +3 more sources
Autoepistemic logic programming
Journal of Automated Reasoning, 1993zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Logic programs as types for logic programs
[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, 2002Optimistic type systems for logic programs are considered. In such systems types are conservative approximations to the success set of the program predicates. The use of logic programs to describe types is proposed. It is argued that this approach unifies the denotational and operational approaches to descriptive type systems and is simpler and more ...
T. Fruhwirth +3 more
openaire +1 more source