295 search results - page 17 / 59 » Approximating the Expressive Power of Logics in Finite Model... |
KBSE
1999
IEEE
15 years 1 months ago
1999
IEEE
Many domain specialists are not familiar or comfortable with formal notations and formal tools like theorem provers or model generators. To address this problem we developed Attem...
176
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
AAAI
2000
14 years 11 months ago
2000
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
AI
2005
Springer
14 years 9 months ago
2005
Springer
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the s...