725 search results - page 34 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
162
Voted
CADE
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
160
Voted
CLIMA
2006
15 years 3 months ago
2006
We present a multi-agent formalism based on extended answer set programming. The system consists of independent agents connected via a communication channel, where knowledge and be...
114
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
101
click to vote
KR
1998
Springer
15 years 6 months ago
1998
Springer
Extended abduction introduced by Inoue and Sakama (1995) generalizes traditional abduction in the sense that it can compute negative explanations by removing hypotheses from a non...
142
click to vote
PPDP
2010
Springer
15 years 11 days ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...