4617 search results - page 837 / 924 » Automation of Diagrammatic Reasoning |
206
click to vote
TPHOL
2005
IEEE
16 years 11 days ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
214
click to vote
XIMEP
2005
ACM
16 years 10 days ago
2005
ACM
Markup languages, representations, schemas, and tools have significantly increased the ability for organizations to share their information. Languages such as the Extensible Marku...
297
click to vote
ASP
2005
Springer
16 years 10 days ago
2005
Springer
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
192
click to vote
ASP
2005
Springer
16 years 10 days ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
187
click to vote
CSL
2005
Springer
16 years 10 days ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...