Sciweavers

254 search results - page 23 / 51
» Answer Sets for Propositional Theories
Sort
View
BIRTHDAY
2010
Springer
14 years 10 months ago
DKAL and Z3: A Logic Embedding Experiment
Yuri Gurevich and Itay Neeman proposed the Distributed Knowledge Authorization Language, DKAL, as an expressive, yet very succinctly expressible logic for distributed authorization...
Sergio Mera, Nikolaj Bjørner
CI
2004
125views more  CI 2004»
14 years 9 months ago
Reasoning about Actions and Planning with Preferences Using Prioritized Default Theory
This paper shows how action theories, expressed in an extended version of the language B, can be naturally encoded using Prioritized Default Theory. We also show how prioritized d...
Tran Cao Son, Enrico Pontelli
CSL
2010
Springer
14 years 10 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 1 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
BIRTHDAY
2000
Springer
15 years 2 months ago
Prioritizing Default Logic
A number of prioritized variants of Reiter’s default logic have been described in the literature. In this paper, we introduce two natural principles for preference handling and s...
Gerhard Brewka, Thomas Eiter