Extending STR to a Higher-Order Consistency | Zendy

Christophe Lecoutre | Zendy; Anastasia Paparrizou | Zendy; Kostas Stergiou | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Extending STR to a Higher-Order Consistency

Author(s) -

Christophe Lecoutre,

Anastasia Paparrizou,

Kostas Stergiou

Publication year - 2013

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.v27i1.8622

Subject(s) - consistency (knowledge bases) , pairwise comparison , local consistency , constraint (computer aided design) , strong consistency , algorithm , computer science , extension (predicate logic) , mathematics , weak consistency , sequential consistency , constraint programming , reduction (mathematics) , simple (philosophy) , property (philosophy) , consistency model , theoretical computer science , constraint satisfaction problem , mathematical optimization , artificial intelligence , statistics , philosophy , geometry , epistemology , stochastic programming , programming language , estimator , probabilistic logic , correctness

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