Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
Copyright policy )Complexity of the Guarded Two-variable Fragment with Counting Quantifiers
We show that the finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME. The method employed also yields a simple proof of a result recently obtained by Y. Kazakov, that the satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
20 pages, 3 figures
- University of Manchester United Kingdom
- University of Manchester United Kingdom
- University of Manchester United Kingdom
- University of Manchester United Kingdom
FOS: Computer and information sciences, Guarded fragment, Computer Science - Logic in Computer Science, Computer Science - Computational Complexity, Logic, Complexity, Counting quantifiers, Two-variable fragment, Computational Complexity (cs.CC), Logic in Computer Science (cs.LO)
FOS: Computer and information sciences, Guarded fragment, Computer Science - Logic in Computer Science, Computer Science - Computational Complexity, Logic, Complexity, Counting quantifiers, Two-variable fragment, Computational Complexity (cs.CC), Logic in Computer Science (cs.LO)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).23 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!