Finite domain and symbolic inference methods for extensions of first-order logic | Zendy

Johan Wittocx | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Finite domain and symbolic inference methods for extensions of first-order logic

Author(s) -

Johan Wittocx

Publication year - 2011

Publication title -

ai communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.337

H-Index - 40

eISSN - 1875-8452

pISSN - 0921-7126

DOI - 10.3233/aic-2010-0474

Subject(s) - computer science , inference , domain (mathematical analysis) , first order logic , order (exchange) , theoretical computer science , artificial intelligence , programming language , mathematics , mathematical analysis , finance , economics

In this dissertation, we investigate various sorts of reasoning on finite structures and theories in the logic FO(.), a rich extension of classical logic with, amongst others, inductive definitions and aggregates. In particular, we study the tasks of constraint propagation, grounding, model revision, and debugging for FO(.).status: publishe

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