Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

rss_1.0 Otros recursos de Robert F. Stark

Resultados 1 - 10 de 98 de Robert F. Stark. (0,16 segundos)

Documentos:
1. (100%) A Complete Axiomatization of the Three-Valued Completion of Logic Programs - Robert F. Stark
We prove the completeness of extended SLDNF-resolution for the new class of "-programs with respect ...
(ps) - 31-mar-2009

2. (100%) Multi-Valued Autoepistemic Logic - Robert F. Stark
We generalize Moore's autoepistemic logic to multi-valued autoepistemic logic, where the set of trut ...
(ps) - 31-mar-2009

3. (100%) The Declarative Semantics of the Prolog Selection Rule - Robert F. Stark
We axiomatize the Prolog selection rule which always selects the leftmost literal in a goal. We intr ...
(ps) - 31-mar-2009

4. (100%) LPTP: A Logic Program Theorem Prover - Robert F. Stark
this report
(pdf) - 31-mar-2009

5. (100%) From Logic Programs to Inductive Definitions - Robert F. Stark
The three-valued Fitting/Kunen semantics is one of the best declarative semantics for negation as fa ...
(pdf) - 31-mar-2009

6. (100%) A Transformation of Propositional Prolog Programs into Classical Logic - Robert F. Stark
. We transform a propositional Prolog program P into a set of propositional formulas prl(P ) and sho ...
(pdf) - 31-mar-2009

7. (100%) Call-By-Value, Call-By-Name and the Logic of Values - Robert F. Stark
. We introduce two logics for partiality, a call-by-value logic and a call-by-name logic. Both logic ...
(pdf) - 31-mar-2009

8. (100%) Multi-Valued Autoepistemic Logic - Robert F. Stark
We generalize Moore's autoepistemic logic to multi-valued autoepistemic logic, where the set of trut ...
(pdf) - 31-mar-2009

9. (100%) A direct proof for the completeness of SLD-resolution - Robert F. Stark
.75> |= A. Then A has an implication tree wrt. P . Proof: We construct a model M of P . Let |M| be the set of all terms (with variables) and let f M ( # t ) := f( # t ). Let r M ( # t ) be true if
(pdf) - 31-mar-2009

10. (100%) A Complete Axiomatization of the Three-Valued Completion of Logic Programs - Robert F. Stark
We prove the completeness of extended SLDNF-resolution for the new class of #-programs with respect ...
(pdf) - 31-mar-2009

Página de resultados:
2  3  4  5  6  7  8  9  10  Siguiente