Listar Ponencias (Ciencias de la Computación e Inteligencia Artificial) por fecha de publicación
Mostrando ítems 1-20 de 442
-
Ponencia
Sobre ciertas expresiones de la función rango, independientes de la teoría de ordinales
(Universitat Autónoma de Barcelona, 1980)In the present work we obtain several representations of the rank func- tion associated to a well founded relation in terms ...
-
Ponencia
A General, Sound and Efficient Natural Language Parsing Algorithm based on Syntactic Constraints Propagation
(AEPIA: Asociación Española para la Inteligencia Artificial, 1997)This paper presents a new context-free parsing algorithm based on a bidirectional strictly horizontal strategy which ...
-
Ponencia
The Maude System
(Springer, 1999) -
Ponencia
Interpretación reactiva de sistemas basados en conocimiento.
(Universidad de Granada, 1999) -
Ponencia
Multiset Relations: A Tool for Proving Termination
(University of Texas, 2000) -
Ponencia
Formalizing Rewriting in the ACL2 Theorem Prover
(Springer, 2000)We present an application of the ACL2 theorem prover to formalize and reason about rewrite systems theory. This can be ...
-
Ponencia
Using Maude
(Springer, 2000) -
Ponencia
A Topological Study of the Upward Refinement Operators on ILP
(CEUR-WS, 2000) -
Ponencia
A Certified Polynomial-Based Decision Procedure for Propositional Logic
(Springer, 2001)In this paper we present the formalization of a decision procedure for Propositional Logic based on polynomial normalization. ...
-
Ponencia
Proximidad entre cláusulas en programación lógica inductiva
(Universidad de Sevilla - Fundación El Monte, 2001) -
Ponencia
Verifying an Applicative ATP Using Multiset Relations
(Springer, 2001)We present in this paper a formalization of multiset relations in the ACL2 theorem prover [6], and we show how multisets ...
-
Ponencia
Deducción Automática en Anillos Ternarios: Algunos Métodos de Procesamiento del Conocimiento Matemático
(Universidad de Sevilla - Fundación El Monte, 2001) -
Ponencia
A Generic Instantiation Tool and a Case Study: A Generic Multiset Theory.
(University of Texas, 2002)In some cases, when we develop a formal theory in ACL2, it would be desirable that the definitions and theorems of the ...
-
Ponencia
Molecular Computation Models in ACL2: a Simulation of Lipton’s Experiment Solving SAT
(2002)In this paper we present an ACL2 formalization of a molecular computing model: Adleman’s restricted model [2]. This is a ...
-
Ponencia
A methodology for the computer-aided cleaning of complex knowledge databases
(IEEE Computer Society, 2002)In environments with complex cognitive structure (such as semantic web or sophisticated spatial databases for geographical ...
-
Ponencia
Progress Report: Term Dags Using Stobjs
(University of Texas, 2002)We explore in this paper the use of efficient data structures to implement operations on first-order terms, that can be ...
- Ponencia
-
Ponencia
Verification in ACL2 of a Generic Framework to Synthesize SAT–Provers
(Springer, 2002)We present in this paper an application of the ACL2 system to reason about propositional satisfiability provers. For that ...
-
Ponencia
A Theory About First-Order Terms in ACL2
(University of Texas, 2002)We describe the development in ACL2 of a library of results about first-order terms. In particular, we present the ...
-
Ponencia
ILP Operators for Propositional Connectionist Networks
(Wright State University, 2002)