Expressive power and abstraction in Essence

DOI10.1007/s10601-008-9050-3zbMath1147.68428OpenAlexW1964542244MaRDI QIDQ941820

Eugenia Ternovska, David G. Mitchell

Publication date: 2 September 2008

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9050-3

zbMATH Keywords

AbstractionDescriptive complexityExpressive powerConstraint modelling languagesModel expansion

Mathematics Subject Classification ID

Theory of programming languages (68N15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (2)

Essence: A constraint language for specifying combinatorial problems ⋮ A framework for step-wise explaining how to solve constraint satisfaction problems

Uses Software

• NP-SPEC
• Gringo
• Lparse
• Zinc
• ESRA
• IDP
• Essence

Cites Work

• Elements of finite model theory.
• The design of the zinc modelling language
• Essence: A constraint language for specifying combinatorial problems
• Capturing complexity classes by fragments of second-order logic
• Metafinite model theory
• Automated reformulation of specifications by safe delay of constraints
• NP-SPEC: an executable specification language for solving all problems in NP
• Relational queries computable in polynomial time
• The DLV system for knowledge representation and reasoning
• Logic Programming and Nonmonotonic Reasoning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Expressive power and abstraction in Essence