1144 search results - page 94 / 229 » Logic programming for combinatorial problems |
101
Voted
BIRTHDAY
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
136
click to vote
LPNMR
2007
Springer
15 years 8 months ago
2007
Springer
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
120
click to vote
AGP
2003
IEEE
15 years 7 months ago
2003
IEEE
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
134
Voted
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
118
click to vote
WOLLIC
2010
Springer
15 years 7 months ago
2010
Springer
The satisfiability and finite satisfiability problems for the two-variable fragment of first-order logic with counting were shown in [5] to be in NExpTime. This paper presents ...