Sciweavers

517 search results - page 27 / 104
» Using dynamic logic programming to model legal reasoning
Sort
View
ICLP
2009
Springer
14 years 8 months ago
Logic Programs under Three-Valued Lukasiewicz Semantics
If logic programs are interpreted over a three-valued logic, then often Kleene's strong three-valued logic with complete equivalence and Fitting's associated immediate co...
Carroline Dewi Puspa Kencana Ramli, Steffen Hö...
PADL
2009
Springer
14 years 8 months ago
Layered Models Top-Down Querying of Normal Logic Programs
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
Alexandre Miguel Pinto, Luís Moniz Pereira
ASP
2005
Springer
14 years 1 months ago
Possibilistic Stable Model Computing
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
Pascal Nicolas, Claire Lefèvre
ESOP
2010
Springer
14 years 5 months ago
Parameterized Memory Models and Concurrent Separation Logic
Formal reasoning about concurrent programs is usually done with the assumption that the underlying memory model is sequentially consistent, i.e. the execution outcome is equivalen...
Rodrigo Ferreira, Xinyu Feng and Zhong Shao
CADE
2008
Springer
14 years 8 months ago
Model Checking for Stability Analysis in Rely-Guarantee Proofs
Rely-guarantee (RG) reasoning is useful for modular Hoare-style proofs of concurrent programs. However, RG requires that assertions be proved stable under the actions of the enviro...
Hasan Amjad, Richard Bornat