Sciweavers

1414 search results - page 21 / 283
» Combining Intruder Theories
Sort
View
NMR
2004
Springer
14 years 3 months ago
Combining goal generation and planning in an argumentation framework
conflicts between goals and plans in Dung’s abstract argumentation framework. Argumentation theory has traditionally been used to deal with conflicts between defaults and beli...
Joris Hulstijn, Leendert W. N. van der Torre
CADE
2002
Springer
14 years 10 months ago
Formal Verification of a Combination Decision Procedure
Decision procedures for combinations of theories are at the core of many modern theorem provers such as ACL2, Ehdm, PVS, SIMPLIFY, the Stanford Pascal Verifier, STeP, SVC, and Z/Ev...
Jonathan Ford, Natarajan Shankar
ITP
2010
156views Mathematics» more  ITP 2010»
14 years 1 months ago
The Optimal Fixed Point Combinator
In this paper, we develop a general theory of fixed point combinators, in higher-order logic equipped with Hilbert’s epsilon operator. This combinator allows for a direct and e...
Arthur Charguéraud
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
AAAI
2006
13 years 11 months ago
Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
Lengning Liu, Miroslaw Truszczynski