1199 search results - page 170 / 240 » Parameterized Proof Complexity |
ICDAR
2009
IEEE
14 years 3 months ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
ICECCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Collaborative development, incremental design and revision management require the ability to compare different versions of software artifacts. There are well-established approache...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
ESWS
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler lang...
FOSSACS
2007
Springer
14 years 3 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...