1242 search results - page 71 / 249 » The Theory of Grammar Constraints |
173
click to vote
IANDC
2008
15 years 6 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
159
click to vote
EPIA
2005
Springer
15 years 11 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
206
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
194
click to vote
ICLP
1995
Springer
15 years 9 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
300
click to vote
ICLP
2009
Springer
16 years 6 months ago
2009
Springer
Over the years, the stable-model semantics has gained a position of the correct (two-valued) interpretation of default negation in programs. However, for programs with aggregates (...