206 search results - page 14 / 42 » Semantics, modularity, and rewriting logic |
LPNMR
2009
Springer
15 years 7 months ago
2009
Springer
Modular nonmonotonic logic programs (MLPs) under the answer-set semantics have been recently introduced as an ASP formalism in which modules can receive context-dependent input fro...
172
Voted
POPL
2002
ACM
16 years 27 days ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
105
click to vote
ADT
2006
15 years 20 days ago
2006
We propose LicenseScript, a language for digital rights management (DRM) based on multiset rewriting and logic programming. LicenseScript enjoys a precise syntax and semantics, an...
118
Voted
CADE
2004
Springer
15 years 6 months ago
2004
Springer
The dependency pair approach is one of the most powerful techniques for automated (innermost) termination proofs of term rewrite systems (TRSs). For any TRS, it generates inequalit...
118
Voted
ENTCS
2007
15 years 16 days ago
2007
In modern functional logic languages like Curry or Toy, programs are possibly non-confluent and nonterminating rewrite systems, defining possibly non-deterministic non-strict fu...