725 search results - page 50 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
138
click to vote
CSL
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
101
click to vote
ISMVL
2010
IEEE
15 years 6 months ago
2010
IEEE
Non-deterministic multi-valued matrices (Nmatrices) are a new, fruitful and quickly expanding field of research first introduced a few years ago. Since then it has been rapidly ...
133
Voted
LPNMR
2001
Springer
15 years 7 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
114
click to vote
TASE
2008
IEEE
15 years 9 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...
156
Voted
JELIA
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...