4513 search results - page 42 / 903 » Logic programming with satisfiability |
272
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
160
click to vote
ACL
2000
15 years 7 months ago
2000
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general satisfiability problem is known to be NP-complete. Here we...
173
click to vote
SIGSOFT
2003
ACM
15 years 11 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
168
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
An often problematic feature in answer set programming is that a program does not always produce an answer set, even for programs which represent default information in a seemingl...
169
click to vote
AMAI
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Partial equilibrium logic (PEL) is a new nonmonotonic reasoning formalism closely aligned with logic programming under well-founded and partial stable model semantics. In...