Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
Home
Publications
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
Author:
IP
Ian Pratt-Hartmann
Ian Pratt-Hartmann
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
23 August 2006
journal article
research article
Published by
Oxford University Press (OUP)
in
Journal of Logic and Computation
Vol. 17
(1)
,
133-155
DOI:
10.1093/logcom/exl034
Abstract
The finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
Keywords
EXPTIME
GUARDED TWO VARIABLE
QUANTIFIERS
SATISFIABILITY PROBLEM
FINITE SATISFIABILITY
All Related Versions
Version 1, 2004-11-10, ArXiv (Unconfirmed version)
Version 1, 2006-01-26, ArXiv (Unconfirmed version)
Version 1, 2008-06-10, ArXiv (Unconfirmed version)
Related articles
Cited
Cited by 64 articles
Scroll to top