65 search results - page 8 / 13 » logcom 2006 |
128
Voted
LOGCOM
2000
15 years 3 days ago
2000
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
99
Voted
LOGCOM
2002
15 years 51 min ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
115
click to vote
LOGCOM
2002
15 years 48 min ago
2002
One can add the machinery of relation symbols and terms to a propositional modal logic without adding quantifiers. Ordinarily this is no extension beyond the propositional. But if...
LOGCOM
2002
15 years 45 min ago
2002
In the area of agent-based computing there are many proposals for specific system architectures, and a number of proposals for general approaches to building agents. As yet, howev...
120
click to vote
LOGCOM
1998
14 years 12 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...