Sciweavers

725 search results - page 40 / 145
» Complexity of Computing with Extended Propositional Logic Pr...
Sort
View
ICALP
2010
Springer
15 years 4 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou
114
Voted
FOSSACS
1999
Springer
15 years 6 months ago
A Strong Logic Programming View for Static Embedded Implications
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...
R. Arruabarrena, Paqui Lucio, Marisa Navarro
ATAL
2006
Springer
15 years 6 months ago
Complexity and succinctness of public announcement logic
There is a recent trend of extending epistemic logic (EL) with dynamic operators that allow to express the evolution of knowledge and induced by knowledge-changing actions. The mo...
Carsten Lutz
165
Voted
APSCC
2010
IEEE
15 years 17 days ago
Personalized Modeling for SaaS Based on Extended WSCL
Software as a service (SaaS) is an emerging software framework in which business data and logic typically integrate with other applications. It requires a unified subscriber to des...
Liu Ying, Zhang Bin, Liu Guoqi, Wang Deshuai, Gao ...
170
Voted
AMAI
1999
Springer
15 years 2 months ago
Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is interesting because it bring advantages of logic prog...
Ilkka Niemelä