778 search results - page 76 / 156 » Expressiveness and complexity of graph logic |
97
Voted
COLING
2000
15 years 1 months ago
2000
Most of the studies in the framework of Lambek calculus have considered the parsing process and ignored the generation process. This paper wants to rely on the close link between ...
151
Voted
RULEML
2010
Springer
14 years 11 months ago
2010
Springer
Rule bases are common in many business rule applications, clinical decision support programs, and other types of intelligent systems. As the size of the rule bases grows and the in...
103
Voted
FOSSACS
2007
Springer
15 years 6 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
117
click to vote
FOSSACS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
87
Voted
LICS
1998
IEEE
15 years 4 months ago
1998
IEEE
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...