Sciweavers

3319 search results - page 112 / 664
» Subshifts, Languages and Logic
Sort
View
LPNMR
2004
Springer
15 years 6 months ago
Planning with Preferences Using Logic Programming
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
Tran Cao Son, Enrico Pontelli
88
Voted
DEXAW
2008
IEEE
93views Database» more  DEXAW 2008»
15 years 7 months ago
Overlay GHC: An Extension of Guarded Horn Clauses for Overlay Programming
Today’s high-speed network allows sophisticated applications of overlay networks. Meanwhile, usage of multicore processors has been spreading. The level of concurrency we need t...
Kenji Saito
173
Voted
POPL
2002
ACM
16 years 29 days ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ECAI
2000
Springer
15 years 5 months ago
Using Description Logics for Ontology Extraction
The paper presents a prototype of a system for querying the Web in natural language (French) for a limited domain. The domain knowledge, represented in description logics (DL), is ...
Amalia Todirascu, François de Bertrand de B...
92
Voted
CSL
2007
Springer
15 years 6 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk