Sciweavers

2303 search results - page 267 / 461
» On the logic of argumentation theory
Sort
View
ATAL
2010
Springer
15 years 7 months ago
An integrated possibilistic framework for goal generation in cognitive agents
We propose an integrated theoretical framework, grounded in possibility theory, to account for all the aspects involved in representing and changing beliefs, representing and gene...
Célia da Costa Pereira, Andrea Tettamanzi
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 9 months ago
Minimum Satisfying Assignments for SMT
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
16 years 1 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
CEEMAS
2005
Springer
16 years 3 days ago
Modelling of Agents' Behavior with Semi-collaborative Meta-agents
Abstract. An autonomous agent may largely benefit from its ability to reconstruct another agent’s reasoning principles from records of past events and general knowledge about th...
Jan Tozicka, Filip Zelezný, Michal Pechouce...
TPHOL
2003
IEEE
15 years 12 months ago
Inductive Invariants for Nested Recursion
Abstract. We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Indu...
Sava Krstic, John Matthews