Filters








36 Hits in 4.8 sec

Translating NP-SPEC into ASP [article]

Mario Alviano, Wolfgang Faber
2013 arXiv   pre-print
NP-SPEC is a language for specifying problems in NP in a declarative way.  ...  In this paper, we present translations from NP-SPEC into various forms of ASP and analyze them.  ...  Introduction NP-SPEC is a language that was proposed in [4, 2] in order to specify problems in the complexity class NP in a simple, clear, and declarative way.  ... 
arXiv:1301.1385v1 fatcat:j5k67nqyczcuvla44eclolvpoi

Effectively solving NP-SPEC encodings by translation to ASP

Mario Alviano, Wolfgang Faber
2015 Journal of experimental and theoretical artificial intelligence (Print)  
NP-SPEC is a language for specifying problems in NP in a declarative way.  ...  We then report on an extensive experimental analysis, which incorporates all previous benchmarks used for NP-SPEC, and also introduces new problem domains taken from ASP Competitions.  ...  ., and by National Group for Scientific Computation (GNCS-INDAM).  ... 
doi:10.1080/0952813x.2014.993505 fatcat:gmhvfmi7krc6rekuc4yskk3zve

Compiling problem specifications into SAT

Marco Cadoli, Andrea Schaerf
2005 Artificial Intelligence  
The system obtained is an executable specification language for all NP problems which shows interesting computational properties.  ...  Problems are specified in a logic-based language, called np-spec, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such to capture exactly all  ...  The authors are grateful to Giovambattista Ianni, Luigi Palopoli, and Domenico Vasile for useful discussion and for providing some examples.  ... 
doi:10.1016/j.artint.2004.01.006 fatcat:yz3z5vlqtbhczbcplnp5edgoni

NP Datalog: a Logic Language for Expressing NP Search and Optimization Problems [article]

Sergio Greco, Cristian Molinaro, Irina Trubitsyna, Ester Zumpano
2009 arXiv   pre-print
This paper presents a logic language for expressing NP search and optimization problems.  ...  This language, called NP Datalog, captures the power of Datalog with unstratified negation in expressing search and optimization problems. A system prototype implementing NP Datalog is presented.  ...  Related Languages and Systems Several languages have been proposed for solving NP problems.  ... 
arXiv:0911.2785v1 fatcat:seapr5odo5flxmdmkm5lmd25ly

Reconstructing Hard Problems in a Human-Readable and Machine-Processable Way [chapter]

Rolf Schwitter
2008 Lecture Notes in Computer Science  
Our approach relies on a collaboration between humans and machines and bridges the gap between a (seemingly informal) problem description and an executable formal specification.  ...  This paper shows how a controlled natural language can help to reconstruct a logic puzzle in a well-defined subset of natural language and discusses how this puzzle can then be processed and solved using  ...  Acknowledgments I am grateful for the constructive comments made by Norbert E. Fuchs on earlier versions of this paper and for the feedback from four anonymous reviewers.  ... 
doi:10.1007/978-3-540-89197-0_105 fatcat:l7yr5wq7rjf55gnaboxizmgfz4

Transforming and Refining Abstract Constraint Specifications [chapter]

Alan M. Frisch, Brahim Hnich, Ian Miguel, Barbara M. Smith, Toby Walsh
2005 Lecture Notes in Computer Science  
A problem may be viewed and transformed at various levels of abstraction. It is often easier to transform an abstract specification rather than a concrete model.  ...  Experts at modelling constraint satisfaction problems carefully choose model transformations to reduce greatly the amount of effort that is required to solve a problem by systematic search.  ...  The language NP-SPEC is a logic-based executable specification language [7, 6] , which allows the user to specify problems that belong to the NP complexity class.  ... 
doi:10.1007/11527862_6 fatcat:eiuj5yekzzhc5hzlksdpzojrxy

PBINT, A Logic for Modelling Search Problems Involving Arithmetic [chapter]

Shahab Tasharrofi, Eugenia Ternovska
2010 Lecture Notes in Computer Science  
Thus, this result gives a remedy to a problem with practical specification languages, namely that there are common arithmetical problems that can be decided in NP but cannot be axiomatized naturally in  ...  As a consequence, our logic (an idealized specification language) allows one to represent common arithmetical problems such as integer factorization or disjoint scheduling naturally, with built-in arithmetic  ...  We also express our gratitude towards the anonymous referees for their useful comments.  ... 
doi:10.1007/978-3-642-16242-8_43 fatcat:nauxh453bzdnreuczw4vku2w64

SAT as an Effective Solving Technology for Constraint Problems [chapter]

Marco Cadoli, Toni Mancini, Fabio Patrizi
2006 Lecture Notes in Computer Science  
In particular, we solve many instances of several common benchmark problems for CP with different SAT solvers, by exploiting the declarative modelling language NPSPEC, and SPEC2SAT, an application that  ...  In this paper we make a preliminary investigatation on the use of SAT technology for solving constraint problems.  ...  The Home Page of the NPSPEC project (www.dis.uniroma1.it/˜cadoli/research/ projects/NP-SPEC/) contains all the specifications proposed in this paper, as well as the program itself.  ... 
doi:10.1007/11875604_61 fatcat:qebhdsvcifcsva7jt65tyxno5q

First Order Logic with Inductive Definitions for Model-Based Problem Solving

Maurice Bruynooghe, Marc Denecker, Miroslaw Truszczynski
2016 The AI Magazine  
In answer-set programming (ASP), programs can be viewed as specifications of finite Herbrand structures.  ...  Other logics can be (and, in fact, were) used towards the same end and can be taken as the basis of declarative programming systems of similar functionality as ASP.  ...  For solving problems, the IDP3 system offers a procedural interface in Lua 3 and executes the procedure main().  ... 
doi:10.1609/aimag.v37i3.2679 fatcat:xqocd5b7k5dpjg3tk25boau6re

Expressive power and abstraction in Essence

David G. Mitchell, Eugenia Ternovska
2008 Constraints  
Development of languages for specifying or modelling problems is an important direction in constraint modelling.  ...  In this paper, we consider the expressiveness of Essence, a specification language with a rich variety of syntactic features.  ...  The tools that have been designed primarily to solve NP-search problems, in many respects, do an admirable job.  ... 
doi:10.1007/s10601-008-9050-3 fatcat:dg64v3pux5gs5pxxxljiqgwl5y

Automatic and efficient simulation of operation contracts

Matthias P. Krieger, Alexander Knapp, Burkhart Wolff
2011 SIGPLAN notices  
contracts is an important technique for requirements validation and prototyping.  ...  We show how these problems can be alleviated and describe an efficient as well as fully automatic approach.  ...  Alloy [22] , NP-SPEC [10] , answer set programming systems (e.g., smodels [29] ) and SAT-based CSP solvers (see e.g., [34] ) are tools that process constraint languages using SAT solvers or similar  ... 
doi:10.1145/1942788.1868303 fatcat:ldleigiryvbexmric3vyj4minq

Automated reformulation of specifications by safe delay of constraints

Marco Cadoli, Toni Mancini
2006 Artificial Intelligence  
In this paper we propose a form of reasoning on specifications of combinatorial problems, with the goal of reformulating them so that they are more efficiently solvable.  ...  of specifications applicable to a great variety of problems, e.g., graph coloring and job-shop scheduling.  ...  the COFIN project "Design and development of a software system for the specification and efficient solution of combinatorial problems, based on a high-level language, and techniques for intensional reasoning  ... 
doi:10.1016/j.artint.2006.01.008 fatcat:tufxx4xp2jcv7mxpep7gw43mx4

Compiling Finite Domain Constraints to SAT with BEE [article]

Amit Metodi, Michael Codish
2012 arXiv   pre-print
We demonstrate that constraint simplification is often highly beneficial when solving hard finite domain constraint problems. A BEE implementation is available with this paper.  ...  BEE is written in Prolog and integrates directly with a SAT solver through a suitable Prolog interface.  ...  For example, Cadoli and Schaerf (2005) introduce NP-SPEC, a logic-based specification language which allows to specify combinatorial problems in a declarative way.  ... 
arXiv:1206.3883v1 fatcat:gnzmxr64ljdctibrjojdzl45ki

Automatic and efficient simulation of operation contracts

Matthias P. Krieger, Alexander Knapp, Burkhart Wolff
2010 Proceedings of the ninth international conference on Generative programming and component engineering - GPCE '10  
contracts is an important technique for requirements validation and prototyping.  ...  We show how these problems can be alleviated and describe an efficient as well as fully automatic approach.  ...  Alloy [22] , NP-SPEC [10] , answer set programming systems (e.g., smodels [29] ) and SAT-based CSP solvers (see e.g., [34] ) are tools that process constraint languages using SAT solvers or similar  ... 
doi:10.1145/1868294.1868303 dblp:conf/gpce/KriegerKW10 fatcat:rt3vssiffrd3bnr2qnlie5gi6q

Compiling Problem Specifications into SAT [chapter]

Marco Cadoli, Andrea Schaerf
Lecture Notes in Computer Science  
The system obtained is an executable specification language for all NP problems which shows interesting computational properties.  ...  Problems are specified in a logic-based language, called np-spec, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such to capture exactly all  ...  The authors are grateful to Giovambattista Ianni, Luigi Palopoli, and Domenico Vasile for useful discussion and for providing some examples.  ... 
doi:10.1007/3-540-45309-1_26 fatcat:kafyvyjfmjhf3pofpnftslkmru
« Previous Showing results 1 — 15 out of 36 results