NP-SPEC: an executable specification language for solving all problems in NP
From MaRDI portal
Publication:2755406
DOI10.1016/S0096-0551(01)00010-8zbMath0995.68025OpenAlexW2051790368WikidataQ127831536 ScholiaQ127831536MaRDI QIDQ2755406
Andrea Schaerf, Giovambattista Ianni, Marco Cadoli, Domenico Vasile, Luigi Palopoli
Publication date: 8 November 2001
Published in: Computer Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0096-0551(01)00010-8
Theory of programming languages (68N15) Specification and verification (program logics, model checking, etc.) (68Q60) Logic programming (68N17)
Related Items (8)
Combining Two Structured Domains for Modeling Various Graph Matching Problems ⋮ \textsc{Conjure}: automatic generation of constraint models from problem specifications ⋮ Compiling problem specifications into SAT ⋮ atalog: A logic language for expressing search and optimization problems ⋮ Essence: A constraint language for specifying combinatorial problems ⋮ Expressive power and abstraction in Essence ⋮ NP-SPEC ⋮ meSAT: multiple encodings of CSP to SAT
This page was built for publication: NP-SPEC: an executable specification language for solving all problems in NP