177 search results - page 5 / 36 » Extending Conceptual Logic Programs with Arbitrary Rules |
TOOLS
2000
IEEE
13 years 12 months ago
2000
IEEE
It is common to imbed business rules within the code of distributed object systems. When business practices and/or policies change, as they often do, it is difficult if not imposs...
ICCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Conceptual graphs (CGs) share with FOL a fundamental expressiveness limitation: only higher-order logics allow assertions of properties on predicates. This paper intends ...
ENTCS
2006
13 years 7 months ago
2006
Parkinson, Bornat, and Calcagno recently introduced a logic for partial correctness in which program variables are treated as resource, generalizing earlier work based on separati...
AML
2006
13 years 7 months ago
2006
We study the formal rst order system Tind in the standard language of Gentzen's LK. Tind extends LK by the purely logical rule of term-induction, that is a restricted inductio...
ECAI
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...