![]() This process is experimental and the keywords may be updated as the learning algorithm improves. They are also basic bricks for more complex constructs, corresponding to more expressive conceptual graphs, for. They can be used as such, to represent facts or queries. ![]() These keywords were added by machine and not by the authors. Part of the Advanced Information and Knowledge Processing book series (AI&KP) Basic or simple graphs constitute the kernel of conceptual graphs. Suppose an object is stationary, keeping the same position for some time. The manner in which an object moves affects the look of the graph - like whether it is horizontal, straight and diagonal, or curved. Note however that these extensions only provide an implicit and very specific form of negation. Position-time graphs (or p-t graphs) show an objects position as a function of time. One advantage of these extensions is to help to distinguish between different kinds of knowledge-a key issue in knowledge-based systems building. ![]() Most conceptual graphs applications are based on BGs and extensions that keep their intuitive graphical appeal, as nested graphs, rules and constraints. In our opinion, full FOL is too complicated at the end-user level, for building knowledge-based systems and understanding how they work, also from a computational viewpoint. In this chapter, we consider the addition of negation to basic graphs.įCGs extend BGs with negation, but in a way that does not suit the approach to knowledge representation developed throughout this book. They are also basic bricks for more complex constructs, corresponding to more expressive conceptual graphs, for instance rules (cf. Basic or simple graphs constitute the kernel of conceptual graphs.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |