Sciweavers

1814 search results - page 165 / 363
» Extended First-Order Logic
Sort
View
PADL
2009
Springer
16 years 4 months ago
Layered Models Top-Down Querying of Normal Logic Programs
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...
Alexandre Miguel Pinto, Luís Moniz Pereira
LICS
2002
IEEE
15 years 8 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
172
Voted
LPAR
1999
Springer
15 years 7 months ago
Practical Reasoning for Expressive Description Logics
Abstract. Description Logics (DLs) are a family of knowledge representation formalisms mainly characterised by constructors to build complex concepts and roles from atomic ones. Ex...
Ian Horrocks, Ulrike Sattler, Stephan Tobies
115
Voted
ICPR
2008
IEEE
16 years 4 months ago
Query by table
Querying any information system requires the knowledge of some formal language, making it inaccessible to computer-na?ve potential users. We propose a new intuitive querying mecha...
George Nagy, Raghav K. Padmanabhan
127
Voted
CADE
2008
Springer
16 years 3 months ago
Compositional Proofs with Symbolic Execution
Abstract. A proof method is described which combines compositional proofs of interleaved parallel programs with the intuitive and highly automatic strategy of symbolic execution. A...
Simon Bäumler, Florian Nafz, Michael Balser, ...