1588 search results - page 182 / 318 » On the Logic of Constitutive Rules |
185
click to vote
ASP
2005
Springer
16 years 8 hour ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
176
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
181
click to vote
AGENTS
2001
Springer
15 years 11 months ago
2001
Springer
We present and implement an infrastructure for automating the negotiation of business contracts. Underlying our system is a declarative language for both (1) fully-specified, exe...
167
click to vote
LOPSTR
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Deforestation is a well-known program transformation technique which eliminates intermediate data structures that are passed between functions. One of its weaknesses is t...
156
click to vote
PADL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...