Sciweavers

6 search results - page 1 / 2
» An inclusion theorem for defeasible logics
Sort
View
133
Voted
TOCL
2010
109views more  TOCL 2010»
14 years 12 months ago
An inclusion theorem for defeasible logics
David Billington, Grigoris Antoniou, Guido Governa...
210
Voted
ICLP
2011
Springer
14 years 8 months ago
Transaction Logic with Defaults and Argumentation Theories
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...
Paul Fodor, Michael Kifer
BIRTHDAY
2010
Springer
15 years 5 months ago
Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners)
Prominent logics, including quantified multimodal logics, can be elegantly embedded in simple type theory (classical higher-order logic). Furthermore, off-the-shelf reasoning syste...
Christoph Benzmüller
170
Voted
CADE
1990
Springer
15 years 9 months ago
IMPS: An Interactive Mathematical Proof System
imps is an Interactive Mathematical Proof System intended as a general purpose tool for formulating and applying mathematics in a familiar fashion. The logic of imps is based on a...
William M. Farmer, Joshua D. Guttman, F. Javier Th...
CONCUR
2009
Springer
15 years 9 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...