227 search results - page 7 / 46 » A Model Theory for Paraconsistent Logic Programming |
TLCA
2007
Springer
14 years 2 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
CCIA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
CADE
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
LPNMR
2004
Springer
14 years 1 months ago
2004
Springer
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX , where k is a non-negative integer and X is a finite set of ...
ICLP
2011
Springer
12 years 12 months ago
2011
Springer
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many ad...