550 search results - page 48 / 110 » Context Semantics, Linear Logic and Computational Complexity |
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
Property testing is concerned with deciding whether an object (e.g. a graph or a function) has a certain property or is “far” (for some definition of far) from every object w...
154
click to vote
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
DBPL
2005
Springer
2005
Springer
Complexity and Approximation of Fixing Numerical Attributes in Databases Under Integrity Constraints
15 years 3 months ago
Consistent query answering is the problem of computing the answers from a database that are consistent with respect to certain integrity constraints that the database as a whole ma...
NMR
2004
Springer
15 years 3 months ago
2004
Springer
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive...
102
click to vote
AI
2011
Springer
14 years 4 months ago
2011
Springer
ating Abstract Argumentation with Classical Logic Arguments: Postulates and Properties Nikos Gorogiannisa , Anthony Hunterb,∗ aDepartment of Computer Science, Queen Mary, Univers...