1083 search results - page 187 / 217 » Using Contextual Logic Programming for Temporal Reasoning |
126
Voted
LPAR
2004
Springer
15 years 7 months ago
2004
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
111
click to vote
ICFP
2005
ACM
16 years 1 months ago
2005
ACM
High-level formalisms for reasoning about names and binding such uijn indices, various flavors of higher-order abstract syntax, ry of Contexts, and nominal abstract syntax address...
101
click to vote
LICS
1996
IEEE
15 years 6 months ago
1996
IEEE
We present a formal model for concurrent systems. The model represents synchronous and asynchronous components in a uniform framework that supports compositional (assume-guarantee)...
128
Voted
VMCAI
2009
Springer
15 years 8 months ago
2009
Springer
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
113
Voted
ASC
2006
15 years 3 months ago
2006
In [7] Maria I. Sessa extended the SLD resolution principle with the ability of performing approximate reasoning and flexible query answering. The operational mechanism of similar...