725 search results - page 27 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
129
click to vote
LICS
2006
IEEE
15 years 8 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
159
click to vote
ACOM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
116
Voted
CORR
2002
Springer
15 years 2 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
123
click to vote
IJCAI
2007
15 years 3 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
109
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a logic of knowledge, belief and certainty, which allows us to explicitly express the knowledge, belief and certainty of an agent. A computationally grounded m...