Sciweavers

746 search results - page 45 / 150
» Connectionist Propositional Logic
Sort
View
JELIA
2010
Springer
14 years 8 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
AAAI
1998
14 years 11 months ago
A Non-Deterministic Semantics for Tractable Inference
Unit resolution is arguably the most useful known algorithm for tractable reasoning in propositional logic. Intuitively, if one knows a, b, and a b c, then c should be an obviou...
James M. Crawford, David W. Etherington
APAL
2005
154views more  APAL 2005»
14 years 10 months ago
A Sahlqvist theorem for distributive modal logic
In this paper we consider distributive modal logic, a setting in which we may add modalities, such as classical types of modalities as well as weak forms of negation, to the fragm...
Mai Gehrke, Hideo Nagahashi, Yde Venema
CADE
1992
Springer
15 years 2 months ago
Isabelle-91
e introducing the types and constants of the logic, i.e. its abstract syntax, and axioms describing the inference rules. As a tiny example, consider the following definition of min...
Tobias Nipkow, Lawrence C. Paulson
BIRTHDAY
2010
Springer
14 years 11 months ago
DKAL and Z3: A Logic Embedding Experiment
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
Sergio Mera, Nikolaj Bjørner