Sciweavers

1814 search results - page 168 / 363
» Extended First-Order Logic
Sort
View
165
Voted
LANMR
2004
15 years 5 months ago
New Semantics for Hybrid Probabilistic Programs
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
Emad Saad
143
Voted
AAECC
2010
Springer
114views Algorithms» more  AAECC 2010»
15 years 3 months ago
Termination of narrowing via termination of rewriting
Abstract Narrowing extends rewriting with logic capabilities by allowing logic variables in terms and by replacing matching with unification. Narrowing has been widely used in diff...
Naoki Nishida, Germán Vidal
134
Voted
JWSR
2007
89views more  JWSR 2007»
15 years 3 months ago
Fully Automated Web Services Discovery and Composition Through Concept Covering and Concept Abduction
: We propose a framework and polynomial algorithms for semantic-based automated Web service composition, fully compliant with Semantic Web technologies. The approach exploits the r...
Azzurra Ragone, Tommaso Di Noia, Eugenio Di Sciasc...
212
Voted
ICLP
2009
Springer
16 years 4 months ago
Modular Nonmonotonic Logic Programming Revisited
Recently, enabling modularity aspects in Answer Set Programming (ASP) has gained increasing interest to ease the composition of program parts to an overall program. In this paper, ...
Minh Dao-Tran, Thomas Eiter, Michael Fink, Thomas ...
119
Voted
TARK
2007
Springer
15 years 9 months ago
A normal simulation of coalition logic and an epistemic extension
In this paper we show how coalition logic can be reduced to the fusion of a normal modal STIT logic for agency and a standard normal temporal logic for discrete time, and how this...
Jan Broersen, Andreas Herzig, Nicolas Troquard