Sciweavers

2022 search results - page 176 / 405
» Complexity of Non-Monotonic Logics
Sort
View
WSC
1997
15 years 8 months ago
AutoMod Tutorial
The AutoModTM simulation system differs significantly from other systems because of its ability to deal with the physical elements of a system in physical (graphical) terms and th...
Matthew W. Rohrer
RR
2010
Springer
15 years 5 months ago
Defeasibility in Answer Set Programs via Argumentation Theories
Defeasible reasoning has been studied extensively in the last two decades and many different and dissimilar approaches are currently on the table. This multitude of ideas has made...
Hui Wan, Michael Kifer, Benjamin N. Grosof
CADE
2004
Springer
16 years 6 months ago
Experiments on Supporting Interactive Proof Using Resolution
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
Jia Meng, Lawrence C. Paulson
DATE
2009
IEEE
93views Hardware» more  DATE 2009»
16 years 1 months ago
Scalable liveness checking via property-preserving transformations
The ability of logic transformations to enhance safety property checking has been well-established, and many industrial-strength verification solutions accordingly rely ariety of...
Jason Baumgartner, Hari Mony
HASE
2005
IEEE
16 years 5 days ago
Automatic Generation of Executable Assertions for Runtime Checking Temporal Requirements
Checking various temporal requirements is a key dependability concern in safety-critical systems. As modelchecking approaches do not scale well to systems of high complexity the r...
Gergely Pintér, István Majzik