Result: A polynomial translation from the two-variable guarded fragment with number restrictions to the guarded fragment
Title:
A polynomial translation from the two-variable guarded fragment with number restrictions to the guarded fragment
Authors:
Source:
Logics in artificial intelligence (Lisbon, 27-30 September 2004)Lecture notes in computer science. :372-384
Publisher Information:
Berlin: Springer, 2004.
Publication Year:
2004
Physical Description:
print, 10 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Intelligence artificielle, Artificial intelligence, Apprentissage et systèmes adaptatifs, Learning and adaptive systems, Codage binaire, Binary coding, Codificación binaria, Intelligence artificielle, Artificial intelligence, Inteligencia artificial, Nombre binaire, Binary number, Número binario, Problème satisfiabilité, Satisfiability problem, Problema satisfactibilidad, Programmation logique, Logical programming, Programación lógica, Satisfaisabilité, Satisfiability, Satisfactoriabilidad, Temps polynomial, Polynomial time, Tiempo polinomial, Logique description, Description logic, Lógica descripción
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
MPI für Informatik, 66123 Saarbrücken, Germany
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16369037
Database:
PASCAL Archive
Further Information
We consider a two-variable guarded fragment with number restrictions for binary relations and give a satisfiability preserving transformation of formulas in this fragment to the three-variable guarded fragment. The translation can be computed in polynomial time and produces a formula that is linear in the size of the initial formula even for the binary coding of number restrictions. This allows one to reduce reasoning problems for many description logics to the satisfiability problem for the guarded fragment.