Sciweavers

1331 search results - page 231 / 267
» Description logic reasoning using the PTTP approach
Sort
View
CAISE
2005
Springer
15 years 4 months ago
A language for modeling enterprise contextual ontologies
To achieve inter-enterprise software interoperability, the semantics of interchanged information by using electronic business documents, has to be explicitly modeled. A common appr...
María Laura Caliusco, César Maidana,...
ICLP
2005
Springer
15 years 4 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
ISM
2005
IEEE
127views Multimedia» more  ISM 2005»
15 years 4 months ago
Distributed User Interface Elements to support Smart Interaction Spaces
In this paper we show how an interactive system can be distributed among several peer devices. By taking advantage of the current trend towards ambient intelligent environments, w...
Kris Luyten, Karin Coninx
SIGSOFT
2007
ACM
15 years 12 months ago
Finding bugs efficiently with a SAT solver
We present an approach for checking code against rich specifications, based on existing work that consists of encoding the program in a relational logic and using a constraint sol...
Julian Dolby, Mandana Vaziri, Frank Tip
CADE
2007
Springer
15 years 11 months ago
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...
Viktor Kuncak, Martin C. Rinard