Results 311 to 319 of about 471,293 (319)
Some of the next articles are maybe not open access.
Formalizing a logic for logic programming
Annals of Mathematics and Artificial Intelligence, 1992Much 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
On computability by logic programs [PDF]
Annals of Mathematics and Artificial Intelligence, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Constraint Logic Programming [PDF]
, 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
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
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
Hybrid Probabilistic Logic Programs as Residuated Logic Programs
2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Luís Moniz Pereira +1 more
openaire +4 more sources
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
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
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
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