Sciweavers

2911 search results - page 220 / 583
» A Logic of Graph Constraints
Sort
View
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 6 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ICCV
2001
IEEE
16 years 8 months ago
Multi-Agent Event Recognition
This paper presents a new approachto recognizingmultiagent events observed by a static camera. To track objects robustly, knowledgeabout the groundplaneand the events is used. An ...
Somboon Hongeng, Ramakant Nevatia
199
Voted
PKDD
2009
Springer
170views Data Mining» more  PKDD 2009»
16 years 1 months ago
Statistical Relational Learning with Formal Ontologies
Abstract. We propose a learning approach for integrating formal knowledge into statistical inference by exploiting ontologies as a semantically rich and fully formal representation...
Achim Rettinger, Matthias Nickles, Volker Tresp
EACL
2003
ACL Anthology
15 years 8 months ago
Describing Syntax with Star-Free Regular Expressions
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
Anssi Yli-Jyrä
WCRE
2007
IEEE
16 years 1 months ago
Dynamic Protocol Recovery
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
Jochen Quante, Rainer Koschke