507 search results - page 74 / 102 » Automating first-order relational logic |
136
click to vote
CAV
2000
Springer
15 years 5 months ago
2000
Springer
Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion . . . . . . . . . . . . . . . . . . . . . . . . . . 1 A. Pnueli Invited Address...
LPNMR
1990
Springer
15 years 4 months ago
1990
Springer
We present a general theory for the use of negative premises in the rules of Transition System Specifications (TSSs). We formulate a criterion that should be satisfied by a TSS in ...
98
Voted
KR
2000
Springer
15 years 4 months ago
2000
Springer
We explore the possibility of a logic where a conclusion substantially improves over its premise(s): Specifically, we intend to rule out inference steps such that the premise conv...
98
Voted
LICS
1991
IEEE
15 years 4 months ago
1991
IEEE
Starting from a logic which speci es how to make deductions from a set of sentences (a ` at theory'), a way to generalise this toa partiallyordered bag ofsentences (a `struct...
126
Voted
COOPIS
2002
IEEE
15 years 5 months ago
2002
IEEE
This paper presents a specifically database-inspired approach (called DOGMA) for engineering formal ontologies, implemented as shared resources used to express agreed formal semant...