Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic
|
| Id. |
41629152 |
| Idioma |
inglés
|
| Titulo |
Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic |
| Autor(es) |
Intuitionistic Logic,Thomas Drakengren,Peter Jonsson
|
| Localización |
http://citeseer.ist.psu.edu/194035.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Automated reasoning about sets has received a considerable amount of
interest in the literature. Techniques for such reasoning have been used in,
for instance, analyses of programming languages, terminological logics and
spatial reasoning. In this paper, we identify a new class of set constraints
where checking satisfiability is tractable (i.e. polynomial-time). We show
how to use this tractability result for constructing a new tractable fragment
of intuitionistic logic. Furthermore, we prove NP-completeness of several
other cases of reasoning about sets.
215
1 Introduction
There has been considerable interest in formalisms for describing and reasoning
about sets. We begin by describing some of these. The most well-studied
class of set constraints is, probably, Herbrand set constraints. Such have been
suggested as a formalism for describing relationships between sets of terms
of a free algebra. A positive set constraint has the form X ` Y , where X
and Y are set expressions. Exam...
|
| Tipo |
ps
|
| Palabras clave |
Intuitionistic Logic,Thomas Drakengren,Peter Jonsson Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://informatix.ida.liu.se/publications/t-phd/1997/0498/paper8.ps.gz
[References] oai:CiteSeerPSU:253393
[References] oai:CiteSeerPSU:98298
[References] oai:CiteSeerPSU:503579
[References] oai:CiteSeerPSU:79621
[References] oai:CiteSeerPSU:165655
[References] oai:CiteSeerPSU:122466
[References] oai:CiteSeerPSU:67972
[References] oai:CiteSeerPSU:236852
[References] oai:CiteSeerPSU:215202
[References] oai:CiteSeerPSU:206812
[References] oai:CiteSeerPSU:12165
[References] oai:CiteSeerPSU:177659
[References] oai:CiteSeerPSU:13774
[References] oai:CiteSeerPSU:52386
[References] oai:CiteSeerPSU:251152
|
| Fecha de contribución |
31-mar-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
