2062 search results - page 136 / 413 » Derivatives of Logical Formulas |
164
click to vote
NMR
2004
Springer
15 years 9 months ago
2004
Springer
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance bo...
111
click to vote
ICLP
1990
Springer
15 years 8 months ago
1990
Springer
Definite Clause Grammars (DCGs) have proved valuable to computational linguists since they can be used to specify phrase structured grammars. It is well known how to encode DCGs i...
138
click to vote
CAV
2008
Springer
15 years 6 months ago
2008
Springer
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
125
click to vote
COMMA
2008
15 years 5 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
126
Voted
AAAI
2004
15 years 5 months ago
2004
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...