3053 search results - page 244 / 611 » A Logic of Abstract Argumentation |
181
click to vote
SIAMCO
2011
14 years 9 months ago
2011
Abstract. We prove a weak version of the dynamic programming principle for standard stochastic control problems and mixed control-stopping problems, which avoids the technical di...
196
click to vote
CSL
2007
Springer
16 years 27 days ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
182
click to vote
ECAI
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
191
click to vote
IEEESCC
2005
IEEE
16 years 9 days ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
163
click to vote
FOSSACS
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. A strong (L) logic programming language ([14, 15]) is given by two subclasses of formulas (programs and goals) of the underlying logic L, provided that: firstly, any pro...