77 search results - page 10 / 16 » Guarded Fixed Point Logic |
111
click to vote
ICALP
2007
Springer
15 years 3 months ago
2007
Springer
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over...
111
click to vote
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Statistical relational models, such as Markov logic networks, seek to compactly describe properties of relational domains by representing general principles about objects...
103
click to vote
AOSD
2007
ACM
15 years 3 months ago
2007
ACM
Modern source-level debuggers support dynamic breakpoints that are guarded by conditions based on program state. Such breakpoints address situations where a static breakpoint is n...
CSL
2004
Springer
15 years 5 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
108
click to vote
CORR
2000
Springer
14 years 11 months ago
2000
Springer
Abstract. We introduce a nonmonotonic framework for belief revision in which reasoning about the reliability of different pieces of information based on meta-knowledge about the in...