Sciweavers

119 search results - page 13 / 24
» Logic of infons: The propositional case
Sort
View
77
Voted
KR
2010
Springer
15 years 2 months ago
Multi-Agent Only-Knowing Revisited
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Vaishak Belle, Gerhard Lakemeyer
CORR
2000
Springer
91views Education» more  CORR 2000»
14 years 9 months ago
Multi-Agent Only Knowing
Levesque introduced the notion of only-knowing to precisely capture the beliefs of a knowledge base. He also showed how only-knowing can be used to formalize non-monotonic behavio...
Joseph Y. Halpern, Gerhard Lakemeyer
CSL
2007
Springer
15 years 3 months ago
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
Abstract. Sequent calculi usually provide a general deductive setting that uniformly embeds other proof-theoretical approaches, such as tableaux methods, resolution techniques, goa...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
AI
2004
Springer
14 years 9 months ago
ASSAT: computing answer sets of a logic program by SAT solvers
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
Fangzhen Lin, Yuting Zhao
KR
2004
Springer
15 years 3 months ago
On Eliminating Disjunctions in Stable Logic Programming
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...