725 search results - page 33 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
160
click to vote
KR
2004
Springer
15 years 11 months ago
2004
Springer
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge repr...
170
click to vote
TCS
2011
15 years 25 days ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
157
click to vote
FOIKS
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We present a novel logic-based approach to automate multi-issue bilateral negotiation in e-marketplaces. In such frameworks issues to negotiate on can be multiple, interr...
150
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
180
click to vote
JDCTA
2010
15 years 21 days ago
2010
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...