Sciweavers

1313 search results - page 60 / 263
» Prioritized Reasoning in Logic Programming
Sort
View
FCSC
2010
170views more  FCSC 2010»
15 years 26 days ago
Formal verification of concurrent programs with read-write locks
Abstract Read-write locking is an important mechanism to improve concurrent granularity, but it is difficult to reason about the safety of concurrent programs with read-write locks...
Ming Fu, Yu Zhang, Yong Li
137
Voted
DALT
2009
Springer
15 years 10 months ago
Playing with Rules
Abstract. In this paper we revisit Logic Programming under the answer-set semantics - or Answer-Set Programming - and its extension Evolving Logic Programming, two languages that u...
João Leite
112
Voted
LPAR
2001
Springer
15 years 8 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
AAAI
2008
15 years 5 months ago
Abductive Logic Programming by Nonground Rewrite Systems
Logic programming with negation offers a compelling approach to abductive reasoning. This paper shows a simple view of abduction in this context for the completion semantics, unde...
Fangzhen Lin, Jia-Huai You
145
Voted
POPL
2010
ACM
16 years 27 days ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...