2722 search results - page 261 / 545 » Automating Language Evolution |
142
click to vote
TPHOL
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper concerns the formal semantics of programming languages, and the specification and verification of software. We are interested in the verification of real programs, wr...
149
click to vote
CCIA
2007
Springer
15 years 10 months ago
2007
Springer
Polysemy is one of the most difficult problems when dealing with natural language resources. Consequently, automated ontology learning from textual sources (such as web resources) ...
129
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
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 ...
150
click to vote
ESWS
2007
Springer
15 years 10 months ago
2007
Springer
State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connective...
132
click to vote
ICLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We provide a general and modular framework for describing inferences in Answer Set Programming (ASP) that aims at an easy incorporation of additional language constructs....