Sciweavers

JAR
2006
106views more  JAR 2006»
13 years 4 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
JAR
2006
94views more  JAR 2006»
13 years 4 months ago
Answer Set Programming Based on Propositional Satisfiability
Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm which has been successfully applied in various application domains. Also motivated by the...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
IJISEC
2008
101views more  IJISEC 2008»
13 years 4 months ago
SAT-based model-checking for security protocols analysis
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
Alessandro Armando, Luca Compagna
AMAI
2006
Springer
13 years 4 months ago
A generalization of the Lin-Zhao theorem
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
ANLP
2000
123views more  ANLP 2000»
13 years 5 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
IJCAI
2003
13 years 5 months ago
Quantifying information and contradiction in propositional logic through test actions
Degrees of information and of contradiction are investigated within a uniform propositional framework, based on test actions. We consider that the degree of information of a propo...
Sébastien Konieczny, Jérôme La...
IJCAI
2007
13 years 5 months ago
Counting Complexity of Propositional Abduction
Abduction is an important method of non-monotonic reasoning with many applications in artificial intelligence and related topics. In this paper, we concentrate on propositional ab...
Miki Hermann, Reinhard Pichler
LPNMR
2009
Springer
13 years 9 months ago
On Reductive Semantics of Aggregates in Answer Set Programming
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
Joohyung Lee, Yunsong Meng