656 search results - page 4 / 132 » Graph Theoretical Characterization and Computation of Answer... |
ASP
2005
Springer
13 years 11 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
AAAI
2007
13 years 8 months ago
2007
Expressive Description Logics (DLs) have been advocated as formalisms for modeling the domain of interest in various application areas. An important requirement is the ability to ...
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
FOCS
2010
IEEE
13 years 3 months ago
2010
IEEE
WG
2004
Springer
13 years 11 months ago
2004
Springer
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...