725 search results - page 18 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
96
Voted
FUIN
2000
15 years 2 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
117
Voted
JAPLL
2010
14 years 9 months ago
2010
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
121
Voted
AIPS
2006
15 years 3 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
SBIA
1998
Springer
15 years 6 months ago
1998
Springer
Abstract. The ability to view extended logic programs as argumentation systems opens the way for the use of this language in formalizing communication among reasoning computing age...
132
click to vote
ADC
2006
Springer
15 years 8 months ago
2006
Springer
We extend Fagin’s result on the equivalence between functional dependencies in relational databases and propositional Horn clauses. It is shown that this equivalence still holds...