Sciweavers

2414 search results - page 107 / 483
» Reasoning Support for OWL-E
Sort
View
ICLP
2001
Springer
15 years 10 months ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski
138
Voted
COLING
2008
15 years 7 months ago
A Linguistic Knowledge Discovery Tool: Very Large Ngram Database Search with Arbitrary Wildcards
In this paper, we will describe a search tool for a huge set of ngrams. The tool supports queries with an arbitrary number of wildcards. It takes a fraction of a second for a sear...
Satoshi Sekine
JAIR
2006
88views more  JAIR 2006»
15 years 5 months ago
On Graphical Modeling of Preference and Importance
In recent years, CP-nets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CP-nets capture and support reasoning with qualitative...
Ronen I. Brafman, Carmel Domshlak, Solomon Eyal Sh...
BIRTHDAY
2010
Springer
15 years 6 months ago
Programming Inductive Proofs - A New Approach Based on Contextual Types
In this paper, we present an overview to programming with proofs in the reasoning framework, Beluga. Beluga supports the specification of formal systems given by axioms and inferen...
Brigitte Pientka
ENTCS
2002
77views more  ENTCS 2002»
15 years 5 months ago
The variety of variables in computer-aided real-time programming
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
Luke Wildman, Colin J. Fidge