z-logo
open-access-imgOpen Access
Algorithms for Deciding Counting Quantifiers over Unary Predicates
Author(s) -
Marcelo Finger,
Glauber De Bona
Publication year - 2017
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v31i1.11129
Subject(s) - unary operation , predicate (mathematical logic) , satisfiability , fragment (logic) , mathematics , algebraic number , integer programming , discrete mathematics , boolean satisfiability problem , lexicographical order , algorithm , reduction (mathematics) , computer science , combinatorics , programming language , mathematical analysis , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom