Results 161 to 170 of about 7,084,339 (219)

Minimal reduct for propositional circumscription. [PDF]

open access: yesFront Artif Intell
Xie Z, Wang Y, Yang L, Feng R.
europepmc   +1 more source

Conceptual logic programs

Annals of Mathematics and Artificial Intelligence, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vermeir, Dirk   +2 more
openaire   +2 more sources

Differential logic programming

Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '93, 1993
In 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

Modular logic programming

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

Logic Programming and Default Logic

International Journal on Artificial Intelligence Tools, 1994
We 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

Support logic programming

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

Extending logic programming

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

Hybrid Probabilistic Logic Programs as Residuated Logic Programs

Studia Logica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Damásio, Carlos Viegas   +1 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy