Sciweavers

344 search results - page 19 / 69
» Some Theorems We Should Prove
Sort
View
JAIR
2007
108views more  JAIR 2007»
13 years 7 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
CHARME
2003
Springer
129views Hardware» more  CHARME 2003»
14 years 17 days ago
On the Correctness of an Intrusion-Tolerant Group Communication Protocol
Intrusion-tolerance is the technique of using fault-tolerance to achieve security properties. Assuming that faults, both benign and Byzantine, are unavoidable, the main goal of Int...
Mohamed Layouni, Jozef Hooman, Sofiène Taha...
MFCS
2005
Springer
14 years 25 days ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
ECSQARU
2001
Springer
13 years 12 months ago
Caveats for Causal Reasoning with Equilibrium Models
In this paper we examine the ability to perform causal reasoning with equilibrium models. We explicate a postulate, which we term the Manipulation Postulate, that is required in o...
Denver Dash, Marek J. Druzdzel
TYPES
2007
Springer
14 years 1 months ago
Attributive Types for Proof Erasure
Abstract. Proof erasure plays an essential role in the paradigm of programming with theorem proving. In this paper, we introduce a form of attributive types that carry an attribute...
Hongwei Xi