Automated formulation of constraint satisfaction problems

Mihaela Sabin; Eugene C. Freuder

Automated formulation of constraint satisfaction problems

Mihaela Sabin
, Eugene C. Freuder

School of Computer Science and Information Technology

University of New Hampshire

Research output: Contribution to conference › Paper › peer-review

Abstract

Problem solving methods in the field of Artificial Intelligence require representation of the problem as a constraint satisfaction problem (CSP) before it can be solved effectively by algorithms. It involves the task of moving the natural statement of the problem to a formulation of the problem as CSPs. Automating problem formulation process is studied using logic puzzles as testbeds. This will help find an effective problem formulation that can support more efficient solutions, as well as incremental problem formulation that supports reasoning from partial information.

Original language	English
Pages	1407
Number of pages	1
Publication status	Published - 1996
Event	Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) - Portland, OR, USA Duration: 4 Aug 1996 → 8 Aug 1996

Conference

Conference	Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2)
City	Portland, OR, USA
Period	4/08/96 → 8/08/96

Cite this

@conference{cba43fd24bb242b4884015e9aa6a2f65,

title = "Automated formulation of constraint satisfaction problems",

abstract = "Problem solving methods in the field of Artificial Intelligence require representation of the problem as a constraint satisfaction problem (CSP) before it can be solved effectively by algorithms. It involves the task of moving the natural statement of the problem to a formulation of the problem as CSPs. Automating problem formulation process is studied using logic puzzles as testbeds. This will help find an effective problem formulation that can support more efficient solutions, as well as incremental problem formulation that supports reasoning from partial information.",

author = "Mihaela Sabin and Freuder, \{Eugene C.\}",

year = "1996",

language = "English",

pages = "1407",

note = "Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2) ; Conference date: 04-08-1996 Through 08-08-1996",

}

TY - CONF

T1 - Automated formulation of constraint satisfaction problems

AU - Sabin, Mihaela

AU - Freuder, Eugene C.

PY - 1996

Y1 - 1996

N2 - Problem solving methods in the field of Artificial Intelligence require representation of the problem as a constraint satisfaction problem (CSP) before it can be solved effectively by algorithms. It involves the task of moving the natural statement of the problem to a formulation of the problem as CSPs. Automating problem formulation process is studied using logic puzzles as testbeds. This will help find an effective problem formulation that can support more efficient solutions, as well as incremental problem formulation that supports reasoning from partial information.

AB - Problem solving methods in the field of Artificial Intelligence require representation of the problem as a constraint satisfaction problem (CSP) before it can be solved effectively by algorithms. It involves the task of moving the natural statement of the problem to a formulation of the problem as CSPs. Automating problem formulation process is studied using logic puzzles as testbeds. This will help find an effective problem formulation that can support more efficient solutions, as well as incremental problem formulation that supports reasoning from partial information.

UR - https://www.scopus.com/pages/publications/0030362264

M3 - Paper

AN - SCOPUS:0030362264

SP - 1407

T2 - Proceedings of the 1996 13th National Conference on Artificial Intelligence. Part 2 (of 2)

Y2 - 4 August 1996 through 8 August 1996

ER -

Automated formulation of constraint satisfaction problems

Abstract

Conference

Other files and links

Fingerprint

Cite this