Results 311 to 320 of about 480,099 (340)
Some of the next articles are maybe not open access.

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   +2 more sources

Formalizing a logic for logic programming

Annals of Mathematics and Artificial Intelligence, 1992
Much research in the last few years has centered upon an idea called negation as failure. Thebasic idea of negation as failure is that, if an atomic “fact” (atomic sentence) is true, it must bedemonstrably true – so if we cannot demonstrate that the atomic sentence is true, we should inferit to be false.Negation as failure clearly is not logically ...
openaire   +2 more sources

Hybrid Probabilistic Logic Programs as Residuated Logic Programs

Studia Logica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luís Moniz Pereira   +1 more
openaire   +4 more sources

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   +3 more sources

On computability by logic programs [PDF]

open access: possibleAnnals of Mathematics and Artificial Intelligence, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Constraint Logic Programming [PDF]

open access: possible, 2002
Constraint Logic Programming (CLP) is one of the most successful branches of Logic Programming; it attracts the interest of theoreticians and practitioners, and it is currently used in many commercial applications. Since the original proposal, it has developed enormously: many languages and systems are now available either as open source programs or as
GAVANELLI, Marco, Francesca Rossi
openaire   +3 more sources

On the logic of programs

Cybernetics, 1979
R. A. Plyushkyavichyus   +3 more
openaire   +3 more sources

Parallelism in logic programs

Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90, 1990
There is a tension between the objectives of avoiding irrelevant computation and extracting parallelism, in that a computational step used to restrict another must precede the latter. Our thesis, following [3], is that evaluation methods can be viewed as implementing a choice ofsideways information propagation graphs, or sips, which determines the set ...
openaire   +3 more sources

Logic Programming with PROLOG

2011
Due to the problems with first-order logic mentioned in Chap. 4, pure logic can not solve most realistic AI problems. Logic programming as a fusion of logic and procedural programming provides the programmer with means for controlling and optimizing logical reasoning.
openaire   +2 more sources

Gallium nitride-based complementary logic integrated circuits

Nature Electronics, 2021
Zheyang Zheng, Li Zhang, Han Xu
exaly  

Home - About - Disclaimer - Privacy