Sciweavers

2067 search results - page 123 / 414
» Logics of propositional control
Sort
View
SAT
2004
Springer
111views Hardware» more  SAT 2004»
15 years 11 months ago
A Note on Satisfying Truth-Value Assignments of Boolean Formulas
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
Zbigniew Stachniak
ISIPTA
2003
IEEE
15 years 11 months ago
Combining Belief Functions Issued from Dependent Sources
Dempster’s rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speci...
Marco E. G. V. Cattaneo
ECAI
2004
Springer
15 years 10 months ago
Many Hands Make Light Work: Localized Satisfiability for Multi-Context Systems
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...
Floris Roelofsen, Luciano Serafini, Alessandro Cim...
AAAI
2008
15 years 8 months ago
What Is Answer Set Programming?
Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in k...
Vladimir Lifschitz
AAAI
2007
15 years 8 months ago
The Semantics of Variables in Action Descriptions
Action description language C+ is more expressive than ADL in many ways; for instance, it addresses the ramification problem. On the other hand, ADL is based on first-order logi...
Vladimir Lifschitz, Wanwan Ren