271 search results - page 9 / 55 » A comparison between two logical formalisms for rewriting |
EWCBR
1998
Springer
14 years 3 days ago
1998
Springer
In this paper the C-CLASSIC Description Logic is used to design the retrieval and selection tasks of a Case-Based Reasoning system with homogeneous, explicit and formal criteria. T...
SAC
2009
ACM
14 years 2 months ago
2009
ACM
We formalize paper fold (origami) by graph rewriting. Origami construction is abstractly described by a rewriting sys), where O is the set of abstract origami’s and ary relation...
CADE
2004
Springer
14 years 8 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...
JOLLI
1998
13 years 7 months ago
1998
When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in thi...
JELIA
2004
Springer
14 years 1 months ago
2004
Springer
This paper is an analysis of two knowledge representation extensions of logic programming, namely Answer Set Programming and ID-Logic. Our aim is to compare both logics on the leve...