Sciweavers

1419 search results - page 73 / 284
» Notes on Formalizing Context
Sort
View
FM
2003
Springer
160views Formal Methods» more  FM 2003»
15 years 5 months ago
Translation-Based Compositional Reasoning for Software Systems
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...
Fei Xie, James C. Browne, Robert P. Kurshan
86
Voted
ECAI
2004
Springer
15 years 4 months ago
Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
Ofer Arieli
78
Voted
ACL
1992
15 years 1 months ago
Connection Relations and Quantifier Scope
A formalism will be presented in this paper which makes it possible to realise the idea of assigning only one scope-ambiguous representation to a sentence that is ambiguous with r...
Longin Jan Latecki
JETAI
2002
71views more  JETAI 2002»
15 years 9 days ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
JELIA
2010
Springer
14 years 10 months ago
Rational Closure for Defeasible Description Logics
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means o...
Giovanni Casini, Umberto Straccia