Sciweavers

215 search results - page 20 / 43
» Connecting a Logical Framework to a First-Order Logic Prover
Sort
View
LOGCOM
2002
105views more  LOGCOM 2002»
14 years 11 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
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...
Alberto Artosi, Guido Governatori, Antonino Rotolo
CI
2004
119views more  CI 2004»
14 years 11 months ago
Reasoning with Sets of Defaults in Default Logic
We present a general approach for representing and reasoning with sets of defaults in default logic, focussing on reasoning about preferences among sets of defaults. First, we con...
James P. Delgrande, Torsten Schaub
JAR
2000
145views more  JAR 2000»
14 years 11 months ago
Logical Cryptanalysis as a SAT Problem
Cryptographic algorithms play a key role in computer security and the formal analysis of their robustness is of utmost importance. Yet, logic and automated reasoning tools are seld...
Fabio Massacci, Laura Marraro
AI
2006
Springer
14 years 11 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 3 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar