2035 search results - page 120 / 407 » On the complexity of stratified logics |
220
click to vote
JSAI
2007
Springer
16 years 15 days ago
2007
Springer
CF-induction is a sound and complete hypothesis finding procedure for full clausal logic which uses the principle of inverse entailment to compute a hypothesis that logically expl...
179
click to vote
ACSC
2006
IEEE
16 years 13 days ago
2006
IEEE
Trust networks consist of transitive trust relationships between people, organisations and software agents connected through a medium for communication and interaction. By formali...
147
click to vote
KES
2005
Springer
15 years 12 months ago
2005
Springer
This paper presents a system for recognizing sketched logic circuits in real-time and graphically simulating them afterwords. It has been developed for use in university and school...
181
click to vote
TABLEAUX
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Description Logics (DLs) are a family of logic based knowledge representation formalisms. Although they have a range of applications (e.g., configuration and information...
188
click to vote
EUROPAR
2004
Springer
15 years 11 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...