z-logo
open-access-imgOpen Access
Boolean Functions with Ordered Domains in Answer Set Programming
Author(s) -
Mario Alviano,
Wolfgang Faber,
Hannes Straß
Publication year - 2016
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.v30i1.10096
Subject(s) - decidability , boolean function , computer science , set (abstract data type) , and inverter graph , theoretical computer science , boolean data type , function (biology) , boolean expression , product term , answer set programming , boolean algebra , polynomial , discrete mathematics , algorithm , mathematics , algebra over a field , programming language , two element boolean algebra , pure mathematics , evolutionary biology , filtered algebra , biology , 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