z-logo
open-access-imgOpen Access
The Complexity of Reasoning with FODD and GFODD
Author(s) -
Benjamin Hescott,
Roni Khardon
Publication year - 2014
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v28i1.8862
Subject(s) - decidability , inference , satisfiability , boolean satisfiability problem , bounded function , mathematics , equivalence (formal languages) , decision problem , heuristic , discrete mathematics , theoretical computer science , algebra over a field , computer science , algorithm , mathematical optimization , pure mathematics , artificial intelligence , mathematical analysis

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