Conference item icon

Conference item

A step up in expressiveness of decidable fixpoint logics

Abstract:

Guardedness restrictions are one of the principal means to obtain decidable logics — operators such as negation are restricted so that the free variables are contained in an atom. While guardedness has been applied fruitfully in the setting of first-order logic, the ability to add fixpoints while retaining decidability has been very limited. Here we show that one of the main restrictions imposed in the past can be lifted, getting a richer decidable logic by allowing fixpoints in which the par...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/2933575.2933592

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More from this funder
Funding agency for:
Benedikt, M
Grant:
EP/L012138/1
CPER Nord-Pas de Calais/FEDER DATA Advanced Data Science and Technologies More from this funder
INRIA Northern European Associate Team More from this funder
Publisher:
Association for Computing Machinery Publisher's website
Journal:
Annual Symposium on Logic in Computer Science Journal website
Host title:
Thirty-First Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Publication date:
2016-07-01
Acceptance date:
2016-04-04
DOI:
Source identifiers:
616304
Pubs id:
pubs:616304
UUID:
uuid:fc8d0e38-b874-4bf5-ade5-b4294941a9a8
Local pid:
pubs:616304
Deposit date:
2016-04-18

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP