Sciweavers

2517 search results - page 43 / 504
» Specifying Weak Sets
Sort
View
AMAI
2006
Springer
14 years 12 months ago
Answer set based design of knowledge systems
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
Marcello Balduccini, Michael Gelfond, Monica Nogue...
ACL
2001
15 years 1 months ago
Grammars for Local and Long Dependencies
Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies : local, explicit...
Alexander Ja. Dikovsky
DKE
2010
80views more  DKE 2010»
14 years 12 months ago
Using ontologies with UML class-based modeling: The TwoUse approach
UML class-based models and OWL ontologies constitute modeling approaches with different strength and weaknesses that make them appropriate for specifying different aspects of soft...
Fernando Silva Parreiras, Steffen Staab
MFCS
2005
Springer
15 years 5 months ago
Autoreducibility, Mitoticity, and Immunity
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
Christian Glaßer, Mitsunori Ogihara, Aduri P...
CIE
2007
Springer
15 years 6 months ago
A Useful Undecidable Theory
Abstract. We show that many so called discrete weak semilattices considered earlier in a series of author’s publications have hereditary undecidable first-order theories. Since ...
Victor L. Selivanov