840 search results - page 51 / 168 » A low-complexity issue logic |
123
click to vote
FOIKS
2008
Springer
15 years 2 months ago
2008
Springer
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
115
Voted
FPGA
2000
ACM
15 years 4 months ago
2000
ACM
In this paper we revisit the FPGA architectural issue of the effect of logic block functionality on FPGA performance and density. In particular, in the context of lookup table, cl...
122
Voted
TPLP
2002
15 years 4 days ago
2002
In this paper, we consider an approach to update nonmonotonic knowledge bases represented as extended logic programs under the answer set semantics. In this approach, new informat...
108
Voted
PADL
2004
Springer
15 years 5 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
116
click to vote
ATAL
2006
Springer
15 years 4 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...