PBINT, a logic for modelling search problems involving arithmetic

DOI10.1007/978-3-642-16242-8_43MaRDI QIDQ4933335zbMATH OpenOpenAlexFDO

Authors Shahab Tasharrofi, Eugenia Ternovska

Publication date 12 October 2010

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16242-8_43

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Descriptive complexity and finite models (68Q19)

Recommendations

• Metafinite model theory
• Expressive power and abstraction in Essence
• scientific article; zbMATH DE number 6606379
• Model-theoretic methods of analysis of computer arithmetic
• Queries with arithmetical constraints

Cited in

(1)

• A compositional typed higher-order logic with definitions

Describes a project that uses

Uses Software

• Gringo
• NP-SPEC

This page was built for publication: PBINT, a logic for modelling search problems involving arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933335)