3119 search results - page 263 / 624 » General Default Logic |
161
click to vote
APAL
1999
15 years 6 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
166
click to vote
RULEML
2010
Springer
15 years 4 months ago
2010
Springer
We propose a systematic investigation on how to modify a preference relation in a defeasible logic theory to change the conclusions of the theory itself. We argue that the approach...
173
click to vote
ISCA
2009
IEEE
16 years 27 days ago
2009
IEEE
While Moore’s Law predicts the ability of semi-conductor industry to engineer smaller and more efficient transistors and circuits, there are serious issues not contemplated in t...
176
click to vote
PPDP
2007
Springer
16 years 11 days ago
2007
Springer
The problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has r...
152
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
This paper introduces AgentSpeak(F), a variation of the BDI logic programming language AgentSpeak(L) intended to permit the model-theoretic verification of multi-agent systems. A...